72 search results - page 14 / 15 » A Branch and Bound Algorithm for Exact, Upper, and Lower Bou... |
COCO
2004
Springer
13 years 11 months ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
SWAT
2004
Springer
13 years 11 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
SOCO
2010
Springer
13 years 22 days ago
2010
Springer
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...
ESA
2009
Springer
14 years 17 days ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...