248 search results - page 17 / 50 » The Multi-Story Space Assignment Problem |
CP
2000
Springer
15 years 4 months ago
2000
Springer
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
115
click to vote
USENIX
2001
15 years 1 months ago
2001
The rapid growth of the Internet has made IP addresses a scarce resource. To get around this problem, today and in the foreseeable future, networks will be deployed with reusable-...
TASE
2010
IEEE
14 years 6 months ago
2010
IEEE
Group elevator scheduling has received considerable attention due to its importance to transportation efficiency for mid-rise and high-rise buildings. One important trend to improv...
137
click to vote
TASE
2010
IEEE
14 years 6 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
124
click to vote
TACAS
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...