1884 search results - page 208 / 377 » Simple Algorithm for Simple Timed Games |
154
click to vote
FPL
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Data dependent circuits are logic circuits specialized to specific input data. They are smaller and faster than the original circuits, although they are not reusable and...
193
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
184
click to vote
ALGORITHMICA
2007
15 years 6 months ago
2007
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
167
click to vote
ADHOCNOW
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. Robots coordinate among themselves to select one of them to respond to an event reported to one of robots. The goal is to minimize the communication cost of selecting bes...
220
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...