|
[1]
|
R. Mayrhofer, H. Gellersen, and M. Hazas, “Security by spatial reference:
Using relative positioning to authenticate devices for spontaneous
interaction,” in Proc. Ubicomp 2007: 9th International Conference on
Ubiquitous Computing, vol. 4717 of LNCS, pp. 199-216,
Springer-Verlag, September 2007.
to appear.
[ bib |
conference link |
.pdf ]
Spontaneous interaction is a desirable characteristic associated with mobile and ubiquitous computing. The aim is to enable users to connect their personal devices with devices encountered in their environment in order to take advantage of interaction opportunities in accordance with their situation. However, it is difficult to secure spontaneous interaction as this requires authentication of the encountered device, in the absence of any prior knowledge of the device. In this paper we present a method for establishing and securing spontaneous interactions on the basis of spatial references that capture the spatial relationship of the involved devices. Spatial references are obtained by accurate sensing of relative device positions, presented to the user for initiation of interactions, and used in a peer authentication protocol that exploits a novel mechanism for message transfer over ultrasound to ensures spatial authenticity of the sender.
|
|
[2]
|
R. Mayrhofer and H. Gellersen, “Shake well before use: two implementations for
implicit context authentication,” in Adjunct Proc. Ubicomp 2007,
September 2007.
to appear.
[ bib |
conference link |
.pdf ]
Secure device pairing is especially difficult for spontaneous interaction in ubiquitous computing environments because of wireless communication, lack of powerful user interfaces, and scalability issues. We demonstrate a method to address this problem for small, mobile devices that does not require explicit user interfaces like displays or key pads. By shaking devices together in one hand for a few seconds, they are securely paired. Device authentication happens implicitly as part of the pairing process without the need for explicit user interaction “just for security”. Our method has been implemented in two variants: first, for high-quality data collection using wired accelerometers; second, using built-in accelerometers in standard Nokia 5500 mobile phones.
|
|
[3]
|
R. Mayrhofer, “The candidate key protocol for generating secret shared keys
from similar sensor data streams,” in Proc. ESAS 2007: 4th European
Workshop on Security and Privacy in Ad hoc and Sensor Networks, vol. 4572 of
LNCS, pp. 1-15, Springer-Verlag, July 2007.
[ bib |
conference link |
.pdf ]
Secure communication over wireless channels necessitates authentication
of communication partners to prevent man-in-the-middle attacks. For
spontaneous interaction between independent, mobile devices, no a
priori information is available for authentication purposes. However,
traditional approaches based on manual password input or verification
of key fingerprints do not scale to tens to hundreds of interactions
a day, as envisioned by future ubiquitous computing environments.
One possibility to solve this problem is authentication based on similar
sensor data: when two (or multiple) devices are in the same situation, and thus
experience the same sensor readings, this constitutes shared, (weakly)
secret information. This paper introduces the Candidate Key
Protocol (CKP) to interactively generate secret shared keys from
similar sensor data streams. It is suitable for two-party and multi-party
authentication, and supports opportunistic authentication.
|
|
[4]
|
R. Mayrhofer and H. Gellersen, “Shake well before use: Authentication based on
accelerometer data,” in Proc. Pervasive 2007: 5th International
Conference on Pervasive Computing, vol. 4480 of LNCS, pp. 144-161,
Springer-Verlag, May 2007.
awarded best Pervasive 2007 paper.
[ bib |
conference link |
.pdf ]
Small, mobile devices without user interfaces, such as Bluetooth headsets,
often need to communicate securely over wireless networks. Active attacks can
only be prevented by authenticating wireless communication, which is
problematic when devices do not have any a priori information about each
other. We introduce a new method for device-to-device authentication by
shaking devices together. This paper describes two protocols for combining
cryptographic authentication techniques with known methods of accelerometer
data analysis to the effect of generating authenticated, secret keys. The
protocols differ in their design, one being more conservative from a security
point of view, while the other allows more dynamic interactions. Three
experiments are used to optimize and validate our proposed authentication
method.
|
|
[5]
|
R. Mayrhofer and M. Welch, “A human-verifiable authentication protocol using
visible laser light,” in Proc. ARES 2007: 2nd International
Conference on Availability, Reliability and Security, pp. 1143-1147, IEEE
CS Press, April 2007.
Track WAIS 2007: 1st International Workshop on Advances in
Information Security.
[ bib |
conference link |
.pdf ]
Securing wireless channels necessitates authenticating communication
partners. For spontaneous interaction, authentication must be efficient
and intuitive. One approach to create interaction and authentication
methods that scale to using hundreds of services throughout the day
is to rely on personal, trusted, mobile devices to interact with
the environment. Authenticating the resulting device-to-device interactions
requires an out-of-band channel that is verifiable by the user. We
present a protocol for creating such an out-of-band channel with visible
laser light that is secure against man-in-the-middle attacks even
when the laser transmission is not confidential. A prototype implementation
shows that an appropriate laser channel can be constructed with simple
off-the-shelf components.
|
|
[6]
|
R. Mayrhofer, “Towards an open source toolkit for ubiquitous device
authentication,” in Workshops Proc. PerCom 2007: 5th IEEE
International Conference on Pervasive Computing and Communications,
pp. 247-252, IEEE CS Press, March 2007.
Track PerSec 2007: 4th IEEE International Workshop on Pervasive
Computing and Communication Security.
[ bib |
conference link |
.pdf ]
Most authentication protocols designed for ubiquitous computing environments
try to solve the problem of intuitive, scalable, secure authentication of
wireless communication. Due to the diversity of requirements, protocols
tend to be implemented within specific research prototypes and can not be
used easily in other applications. We propose to develop a common toolkit for
ubiquitous device authentication to foster wide usability of research results.
This paper outlines design goals and presents a first, freely available
implementation.
|
|
[7]
|
R. Mayrhofer and H. Gellersen, “On the security of ultrasound as out-of-band
channel,” in Proc. IPDPS 2007: 21st IEEE International Parallel and
Distributed Processing Symposium, p. 321, IEEE CS Press, March 2007.
Track SSN 2007: 3rd International Workshop on Security in Systems
and Networks.
[ bib |
conference link |
.pdf ]
Ultrasound has been proposed as out-of-band channel for authentication of peer devices in wireless ad hoc networks. Ultrasound can implicitly contribute to secure communication based on inherent limitations in signal propagation, and can additionally be used explicitly by peers to measure and verify their relative positions. In this paper we analyse potential attacks on an ultrasonic communication channel and peer-to-peer ultrasonic sensing, and investigate how potential attacks translate to application-level threats for peers seeking to establish a secure wireless link. Based on our analysis we propose a novel method for authentic communication of short messages over an ultrasonic channel.
|
|
[8]
|
R. Mayrhofer, “Extending the growing neural gas classifier for context
recognition,” LNCS, Springer-Verlag, February 2007.
accepted for publication at the Workshop for Heuristic Problem
Solving at EUROCAST 2007.
[ bib |
conference link |
.pdf ]
Context awareness is one of the building blocks of many applications in
pervasive computing. Recognizing the current context of a user or
device, that is, the situation in which some action happens, often
requires dealing with data from different sensors, and thus different
domains.
The Growing Neural Gas algorithm is a classification algorithm
especially designed for un-supervised learning of unknown input distributions;
a variation, the Lifelong Growing Neural Gas (LLGNG), is well suited
for arbitrary long periods of learning, as its internal parameters
are self-adaptive. These features are ideal for automatically classifying
sensor data to recognize user or device context.
However, as most
classification algorithms, in its standard form it is only suitable
for numerical input data. Many sensors which are available on current
information appliances are nominal or ordinal in type, making their
use difficult. Additionally, the automatically created clusters are
usually too fine-grained to distinguish user-context on an application
level.
This paper presents general and heuristic extensions to the LLGNG classifier which allow its direct application for context recognition.
On a real-world data set with two months of heterogeneous data from
different sensors, the
extended LLGNG classifier compares favorably to k-means and SOM classifiers.
|
|
[9]
|
R. Mayrhofer, “A context authentication proxy for IPSec using spatial
reference,” in Proc. TwUC 2006: 1st International Workshop on
Trustworthy Ubiquitous Computing, pp. 449-462, Austrian Computer Society
(OCG), December 2006.
awarded best iiWAS/MoMM 2007 workshop paper.
[ bib |
conference link |
.pdf ]
Spontaneous interaction in ad-hoc networks is often desirable not only between users
or devices in direct contact, but also with devices that are accessible
only via a wireless network. Secure communication with such devices
is difficult because of the required authentication, which is often
either password- or certificate-based. An intuitive alternative is
context-based authentication, where device authenticity is verified
by shared context, and often by direct physical evidence. Devices
that are physically separated can not experience the same context and can thus not
benefit directly from context authentication. We introduce
a context authentication proxy that is pre-authenticated with one
of the devices and can authenticate with the other by shared context.
This concept is applicable to a wide range of application scenarios,
context sensing technologies, and trust models. We show its practicality
in an implementation for setting up IPSec connections based on spatial
reference. Our specific scenario is ad-hoc access of mobile devices
to secure 802.11 WLANs using a PDA as authentication proxy.
|
|
[10]
|
R. Mayrhofer, “Technische Hintergründe für das rechtliche Handeln im
Internet,” in Aktuelles zum Internet-Recht, pp. 1-16,
proLibris.at, December 2005.
[ bib |
conference link |
.pdf ]
Internet-Recht bewegt sich grundsätzlich an der Schnittstelle zwischen Gesetzgebung und Technik. Wie an vielen Schnittstellen gibt es auch hier Schwierigkeiten zu
überwinden, und zwar nicht nur in der Findung gemeinsamer Ziele, Arbeitsgruppen
und schlussendlich Lösungen, sondern vor allem im gegenseitigen Verständnis der
den jeweils anderen Bereich betreffenden Probleme. Dieser Beitrag soll die technischen Hintergründe einiger aktueller Themen an dieser Schnittstelle allgemein verständlich näher bringen. Die Auswahl an Themen, welche aus technischer Sicht
einer Klärung durch die Gesetzgebung bedürfen bzw. derer, die durch neue Gesetze die Entwicklung neuer technischer Systeme erfordern, ist derzeit kaum mehr
überschaubar und wächst weiter. Daher erfolgt in diesem Beitrag eine Konzentration auf die technischen Grundlagen für viele dieser Themen sowie auf eine kleine
Auswahl von Themen, die von allgemeinem, auch öffentlichem bzw. gesellschaftlichem Interesse sind. Konkret werden die folgenden Themen angesprochen:
Grundlagen der Kryptographie, Sichere Signatur, Digitales Rechte Management (DRM)
und Peer-to-Peer Systeme.
Diese Themen stellen eine subjektive Auswahl dar, sollten jedoch die derzeit am
stärksten – auch durch die Tagespresse – diskutierten Gebiete abdecken. Der Beitrag ist auf Leser ohne technisches Detailwissen ausgerichtet, Erfahrung im Um-
gang mit Computersystemen, also zum Beispiel mit Webbrowsern und Emailprogrammen, wird jedoch angenommen.
|
|
[11]
|
A. Ferscha, M. Hechinger, R. Mayrhofer, E. Chtcherbina, M. Franz, M. dos
Santos Rocha, and A. Zeidler, “Bridging the gap with P2P patterns,” in
Proceedings of the Workshop on Smart Object Systems, September 2005.
in conjunction with the Seventh International Conference on
Ubiquitous Computing (UbiComp 2005), available at
http://ubicomp.lancs.ac.uk/workshops/sobs05/papers/04-Ferscha,Alois.pdf.
[ bib |
conference link |
.pdf ]
Abstract The design principles of pervasive computing software architectures are widely driven by the need for opportunistic interaction
among distributed, mobile and heterogeneous entities in the absence of
global knowledge and naming conventions. Peer-to-Peer (P2P) frameworks have evolved, abstracting the access to shared, while distributed
information. To bridge the architectural gap between P2P applications
and P2P frameworks we propose patterns as an organizational schema
for P2P based software systems. Our Peer-it hardware platform is used
to demonstrate an application in the domain of flexible manufacturing
systems.
|
|
[12]
|
R. Mayrhofer, “Eine Architektur zur Kontextvorhersage,” in
Ausgezeichnete Informatikdissertationen 2004, vol. D-5 of Series of
the German Informatics society (GI), pp. 125-134, Lecture Notes in
Informatics (LNI), May 2005.
[ bib |
.pdf ]
So genannte “kontextsensitive Systeme” haben zum Ziel, die eingesetzten
Computersysteme automatisch an die aktuellen Situationen anzupassen
und damit bessere Interaktion mit der Umgebung zu ermöglichen. Diese
Arbeit befasst sich mit dem nächsten logischen Schritt nach der Erkennung
des jeweils aktuellen Kontextes, nämlich der Vorhersage zukünftiger
Kontexte. Zu diesem Zweck wurde eine mehrschrittige Software-Architektur
entwickelt, welche aus den Daten mehrerer einfacher Sensoren die aktuellen und
zukünftig erwarteten Kontexte gewinnt.
Die entwickelte Architektur wurde bereits in Form eines flexiblen
Software-Frameworks umgesetzt und mit aufgezeichneten Daten aus alltäglichen
Situationen evaluiert. Diese Betrachtung zeigt, dass die Vorhersage
abstrakter Kontexte in Grenzen bereits möglich ist, jedoch noch Raum
für Verbesserungen der Vorhersagequalität in zukünftigen Arbeiten
offen bleibt.
|
|
[13]
|
R. Mayrhofer, “Context prediction based on context histories: Expected
benefits, issues and current state-of-the-art,” in Proc. ECHISE 2005:
1st International Workshop on Exploiting Context Histories in Smart
Environments (T. Prante, B. Meyers, G. Fitzpatrick, and L. D. Harvel, eds.),
May 2005.
part of the Third International Conference on Pervasive Computing
(PERVASIVE 2005).
[ bib |
conference link |
.pdf ]
This paper presents the topic of context prediction as one
possibility to exploit context histories. It lists some
expected benefits of context prediction for certain
application areas and discusses the associated issues in
terms of accuracy, fault tolerance, unobtrusive operation,
user acceptance, problem complexity and privacy. After
identifying the challenges in context prediction, a first
approach is summarized briefly. This approach, when
applied to recorded context histories, builds upon three
steps of a previously introduced software architecture:
feature extraction, classification and prediction. Open
issues remain in the areas of prediction accuracy, dealing
with limited resources, sharing of context information and
user studies.
|
|
[14]
|
R. Mayrhofer, “An architecture for context prediction,” in Advances in
Pervasive Computing (A. Ferscha, H. Hörtner, and G. Kotsis, eds.),
vol. 176, pp. 65-72, Austrian Computer Society (OCG), April 2004.
part of the Second International Conference on Pervasive Computing
(PERVASIVE 2004).
[ bib |
conference link |
.pdf ]
Today's information appliances are usually very powerful,
featuring local storage and processing power, communication technology
and supporting many different applications. They are either mobile, like
laptop computers, handheld devices, mobile phones or wearables, or fixed,
like TV set-top boxes, home entertainment centers or even whole rooms
equipped with various interacting devices; but most of them have various
hardware components that can be used as sensors for querying the environment.
By exploiting these sensors, it is possible to make devices context aware
and thus adaptive to the current user's situation. This paper presents the
basic structure of a framework which eases the implementation of context
aware applications by providing the current and future, predicted context.
|
|
[15]
|
R. Mayrhofer, H. Radi, and A. Ferscha, “A context prediction code and data
base,” in Proceedings of the Benchmarks and a Database for Context
Recognition Workshop (H. Junker, P. Lukowicz, and J. Mäntyjarvi, eds.),
pp. 20-26, ETH Zurich, April 2004.
part of the Second International Conference on Pervasive Computing
(PERVASIVE 2004).
[ bib |
conference link |
.pdf ]
Many of the currently available sensors do not provide simple, numerical
values but more complex data like a list of other devices in range.
Although these sensors can, in the general case, not be transformed
to numerical values, they nonetheless provide valuable information
about the device or user context. For exploiting all available context
information, it is thus important to also regard ordinal and nominal
sensor values. In this paper, we propose to jointly develop a meta
data format for the evaluation and assessment of context recognition
and prediction methods.
|
|
[16]
|
H. Radi, R. Mayrhofer, and A. Ferscha, “A notebook sensory data set for
context recognition,” in Proceedings of the Benchmarks and a Database
for Context Recognition Workshop (H. Junker, P. Lukowicz, and
J. Mäntyjarvi, eds.), pp. 17-19, ETH Zurich, April 2004.
part of the Second International Conference on Pervasive Computing
(PERVASIVE 2004).
[ bib |
conference link |
.pdf ]
For a qualitative and quantitative assessment of context prediction and recognition methods,
real-world data sets are inevitable.
By collecting sensor data on a single notebook over a period of a few months
we got a rather large log file of homogeneous and heterogeneous features reflecting
the users activities during this time frame.
In this paper we present which devices were exploited as sensors, which information was logged
and how this information was stored for further processing by classification algorithms.
|
|
[17]
|
A. Ferscha, M. Hechinger, R. Mayrhofer, M. dos Santos Rocha, M. Franz, and
R. Oberhauser, “Digital Aura,” in Advances in Pervasive Computing
(A. Ferscha, H. Hörtner, and G. Kotsis, eds.), vol. 176, pp. 405-410,
Austrian Computer Society (OCG), April 2004.
part of the Second International Conference on Pervasive Computing
(Pervasive 2004).
[ bib |
conference link |
video |
.pdf ]
Smart space and smart appliances, i.e. wirelessly ad-hoc networked, mobile, autonomous
special purpose computing devices, providing largely invisible support and context-aware services have started to populate the real world and our daily lives. In such a
world, where literally everything is connected to everything with invisible, wireless data
links, we need new styles on how humans and things can interact. We have proposed a
“spontaneous interaction” thought model, in which things start to interact once they
reach physical proximity to each other: Explained using the metaphor of an “aura”,
which like a subtle invisible emanation or exhalation radiates from the center of an
object into its surrounding, a “digital aura” is built on technologies like Bluetooth radio,
RFID or IrDA together with an XML based profile description, such that if an object
detects the proximity (e.g. radio signal strength) of another object, it starts exchanging
and comparing profile data, and, upon sufficient “similarity” of the two profiles, starts to
interact with that object. A “digital aura” depending on the implementation technology,
is dense in the center of the object, and thins out towards its surrounding until it is no
longer sensible by others. Profiles described as semi-structured data and attached to the
object, can be matched by a structural and semantic analysis. Peer-to-peer concepts can
then be used to implement applications on top of the digital aura model for spontaneous
interaction.
|
|
[18]
|
A. Ferscha, M. Hechinger, R. Mayrhofer, and R. Oberhauser, “A light-weight
component model for peer-to-peer applications,” in Proceedings of the
2nd International Workshop on Mobile Distributed Computing (MDC04),
pp. 520-527, IEEE Computer Society Press, March 2004.
[ bib |
conference link |
.pdf ]
Mobile Peer-to-Peer (P2P) computing applications
involve collections of heterogeneous and resource-limited
devices (such as PDAs or embedded sensor-actuator
systems), typically operated in ad-hoc completely
decentralized networks and without requiring dedicated
infrastructure support. Short-range wireless
communication technologies together with P2P
networking capabilities on mobile devices are responsible
for a proliferation of such applications, yet these
applications are often complex and monolithic in nature
due to the lack of lightweight component/container
support in these resource-constrained devices.
In this paper we describe our lightweight software
component model P2Pcomp that addresses the
development needs for mobile P2P applications. An
abstract, flexible, and high-level communication
mechanism among components is developed via a ports
concept, supporting protocol independence, location
independence, and (a)synchronous invocations;
dependencies are not hard-coded in the components, but
can be defined at deployment or runtime, providing late-binding and dynamic rerouteability capabilities. Peers
can elect to provide services as well as consume them,
services can migrate between containers, and services are
ranked to support Quality-of-Service choices. Our
lightweight container realization leverages the OSGi
platform and can utilize various P2P communication
mechanisms such as JXTA. A “smart space” application
scenario demonstrates how P2Pcomp supports flexible
and highly tailorable mobile P2P applications.
|
|
[19]
|
R. Mayrhofer, H. Radi, and A. Ferscha, “Feature extraction in wireless
personal and local area networks,” in Proc. MWCN 2003: 5th
International Conference on Mobile and Wireless Communications Networks,
pp. 195-198, World Scientific, October 2003.
[ bib |
conference link |
.pdf ]
Context awareness is currently being investigated for applications
in different areas, including Mobile Computing. Many mobile devices
are already shipped with support for Bluetooth and Wireless LAN, making
these technologies commonly available. It is thus possible to exploit
the wireless interfaces as sensors for deriving information about
the device/user context. However, extracting features from typical
Bluetooth or Wireless LAN properties is difficult because not only
numerical, but also non-numerical features like the list of MAC addresses
in range are important for context awareness. In this paper, we introduce
a method to automatically classify these highly heterogeneous features
with supervised or un-supervised classification methods. By defining
two operators, a distance metric and an adaption operator, any feature
can be used as input for the classifier and can thus contribute to
context detection.
|
|
[20]
|
R. Mayrhofer, H. Radi, and A. Ferscha, “Recognizing and predicting context by
learning from user behavior,” in Proc. MoMM 2003: 1st International
Conference On Advances in Mobile Multimedia (W. S. G. Kotsis, A. Ferscha and
K. Ibrahim, eds.), vol. 171, pp. 25-35, Austrian Computer Society (OCG),
September 2003.
[ bib |
conference link |
http |
.pdf ]
Current mobile devices like mobile phones or personal digital assistants
have become more and more powerful; they already offer features that
only few users are able to exploit to their whole extent. With a number
of upcoming mobile multimedia applications,
ease of use
becomes one of the most important aspects. One way to improve usability
is to make devices aware of the user's context, allowing them to adapt
to the user instead of forcing the user to adapt to the device. Our
work is taking this approach one step further by not only reacting
to the current context, but also predicting future context, hence
making the devices proactive. Mobile devices are generally suited
well for this task because they are typically close to the user even
when not actively in use. This allows such devices to monitor the
user context and act accordingly, like automatically muting ring or
signal tones when the user is in a meeting or selecting audio, video
or text communication depending on the user's current occupation.
This paper presents an architecture that allows mobile devices to
continuously recognize current and anticipate future user context.
The major challenges are that context recognition and prediction should
be embedded in mobile devices with limited resources, that learning
and adaption should happen on-line without explicit training phases
and that user intervention should be kept to a minimum with non-obtrusive
user interaction. To accomplish this, the presented architecture consists
of four major parts: feature extraction, classification, labeling
and prediction. The available sensors provide a multi-dimensional,
highly heterogeneous input vector as input to the classification step,
realized by data clustering. Labeling associates recognized context
classes with meaningful names specified by the user, and prediction
allows to forecast future user context for proactive behavior.
|
|
[21]
|
R. Mayrhofer, F. Ortner, A. Ferscha, and M. Hechinger, “Securing passive
objects in mobile ad-hoc peer-to-peer networks,” in Electronic Notes in
Theoretical Computer Science (R. Focardi and G. Zavattaro, eds.), vol. 85.3,
Elsevier Science, June 2003.
[ bib |
conference link |
.pdf ]
Security and privacy in mobile ad-hoc peer-to-peer environments are hard to
attain, especially when working with passive objects without own processing
power. We introduce a method for integrating such objects into a
peer-to-peer environment without infrastructure components while providing
a high level of privacy and security for peers interacting with objects. The
integration is done by equipping passive objects with public keys, which can
be used by peers to validate proxies acting on behalf of the objects. To
overcome the problem of limited storage capacity on small embedded objects,
ECC keys are used.
|
|
[22]
|
R. Mayrhofer, M. Affenzeller, H. Prähofer, G. Höfer, and A. Fried, “DEVS
simulation of spiking neural networks,” in Cybernetics and Systems:
Proc. EMCSR 2002: 16th European Meeting on Cybernetics and Systems
Research (R. Trappl, ed.), vol. 2, pp. 573-578, Austrian Society for
Cybernetic Studies, April 2002.
[ bib |
conference link |
.ps ]
This paper presents a new model for simulating Spiking Neural
Networks using discrete event simulation which might
possibly offer advantages concerning simulation speed and
scalability. Spiking Neural Networks are considered as a new
computation paradigm, representing an enhancement of Artificial
Neural Networks by offering more flexibility and degree of freedom
for modeling computational elements. Although this type of Neural
Networks is rather new and there is not very much known about its
features, it is clearly more powerful than its predecessor, being
able to simulate Artificial Neural Networks in real time but also
offering new computational elements that were not available
previously. Unfortunately, the simulation of Spiking Neural
Networks currently involves the use of continuous simulation
techniques which do not scale easily to large networks with many
neurons. Within the scope of the present paper, we discuss a new
model for Spiking Neural Networks, which allows the use of
discrete event simulation techniques, possibly offering
enormous advantages in terms of simulation flexibility and
scalability without restricting the qualitative computational
power.
|
|
[23]
|
M. Affenzeller and R. Mayrhofer, “Generic heuristics for combinatorial
optimization problems,” in Proceedings of the 9th International
Conference on Operational Research (KOI2002), pp. 83-92, 2002.
[ bib |
.ps ]
|