1355 search results - page 174 / 271 » Alternating Timed Automata over Bounded Time |
SIGIR
1992
ACM
14 years 1 months ago
1992
ACM
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
STOC
1992
ACM
14 years 1 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
CP
2008
Springer
13 years 10 months ago
2008
Springer
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...
IEICET
2006
13 years 9 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
IJCGA
2002
13 years 8 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...