1263 search results - page 65 / 253 » A* with Bounded Costs |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Recently, a vector version of Witsenhausen's counterexample was considered and it was shown that in that limit of infinite vector length, certain quantization-based strategie...
DSN
2005
IEEE
15 years 3 months ago
2005
IEEE
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avo...
170
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
The serious bugs and security vulnerabilities facilitated by C/C++'s lack of bounds checking are well known, yet C and C++ remain in widespread use. Unfortunately, C's a...
RTSS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
COCO
2003
Springer
15 years 3 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...