Sciweavers

3082 search results - page 335 / 617
» New Bounds for the Controller Problem
Sort
View
KI
2001
Springer
15 years 11 months ago
Extracting Situation Facts from Activation Value Histories in Behavior-Based Robots
The paper presents a new technique for extracting symbolic ground facts out of the sensor data stream in autonomous robots for use under hybrid control architectures, which compris...
Frank Schönherr, Mihaela Cistelecan, Joachim ...
HOTOS
1997
IEEE
15 years 11 months ago
Security for Extensible Systems
The recent trend towards dynamically extensible systems, such as Java, SPIN or VINO, promises more powerful and flexible systems. At the same time, the impact of extensibility on...
Robert Grimm, Brian N. Bershad
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 7 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
TALG
2010
158views more  TALG 2010»
15 years 1 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
SOFSEM
2010
Springer
16 years 3 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz