8496 search results - page 468 / 1700 » Problem Solving and Complex Systems |
177
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
171
click to vote
ICRA
2006
IEEE
16 years 1 months ago
2006
IEEE
— We study the motion planning problem for planar star-shaped manipulators. These manipulators are formed by joining k “legs” to a common point (like the thorax of an insect)...
207
click to vote
CAV
2001
Springer
16 years 3 days ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
247
click to vote
INFOCOM
2000
IEEE
15 years 12 months ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
190
click to vote
AAAI
2000
15 years 9 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...