1263 search results - page 241 / 253 » A* with Bounded Costs |
CG
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
DFG
2004
Springer
13 years 11 months ago
2004
Springer
This paper presents the real-time model checker RAVEN and related theoretical background. RAVEN augments the efficiency of traditional symbolic model checking with possibilities to...
EDBT
2006
ACM
13 years 11 months ago
2006
ACM
Abstract. In wireless data broadcast systems, popular information is repetitively disseminated through possibly multiple communication channels to mobile clients using various type...
CLUSTER
2001
IEEE
13 years 11 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
PLDI
1995
ACM
13 years 11 months ago
1995
ACM
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...