3223 search results - page 379 / 645 » The Scaling of Search Cost |
159
click to vote
AIPS
2006
15 years 8 months ago
2006
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
142
click to vote
IJCAI
2001
15 years 8 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
172
click to vote
ECIS
2003
15 years 8 months ago
2003
Due to the extensive development und use of information technology, a lot of companies gained access to vast internal and external information sources. Yet nonetheless, efficiency...
205
click to vote
IJCAI
2001
15 years 8 months ago
2001
This paper presents an efficient online mode estimation algorithm for a class of sensor-rich, distributed embedded systems, the so-called hybrid systems. A central problem in dist...
196
click to vote
IC
2003
15 years 8 months ago
2003
Magic Square is a ppeer-to-peer protocol for searching resources. The recovery cost of Magic Square is high and the system doesn’t recover the failure in simultaneous neighbor n...