1434 search results - page 174 / 287 » Graph Searching with Advice |
129
Voted
IJRR
2010
15 years 28 days ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
149
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
116
Voted
BIRTHDAY
1991
Springer
15 years 7 months ago
1991
Springer
The goal of the MKRP project is the development of a theorem prover which can be used as an inference engine in various applications, in particular it should be capable of proving ...
123
Voted
DAC
2001
ACM
16 years 4 months ago
2001
ACM
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuit...
151
Voted
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...