Sciweavers

3341 search results - page 556 / 669
» On Bounded Queries and Approximation
Sort
View
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
15 years 3 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
MFCS
2004
Springer
15 years 3 months ago
The Price of Anarchy for Polynomial Social Cost
Abstract. In this work, we consider an interesting variant of the wellstudied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [3...
Martin Gairing, Thomas Lücking, Marios Mavron...
CODES
2003
IEEE
15 years 3 months ago
Deriving process networks from weakly dynamic applications in system-level design
We present an approach to the automatic derivation of executable Process Network specifications from Weakly Dynamic Applications. We introduce the notions of Dynamic Single Assig...
Todor Stefanov, Ed F. Deprettere
DCC
2003
IEEE
15 years 3 months ago
Universal Multiple Description Scalar Quantization: Analysis and Design
—This paper introduces a new high-rate analysis of the multiple description scalar quantizer (MDSQ) with balanced descriptions. The analysis provides insight into the structure o...
Chao Tian, Sheila S. Hemami
ICRA
2003
IEEE
222views Robotics» more  ICRA 2003»
15 years 3 months ago
Path planning using learned constraints and preferences
— In this paper we present a novel method for robot path planning based on learning motion patterns. A motion pattern is defined as the path that results from applying a set of ...
Gregory Dudek, Saul Simhon