1983 search results - page 76 / 397 » Competitive graph searches |
121
click to vote
ASPDAC
2000
ACM
15 years 7 months ago
2000
ACM
- This paper describes the design and implementation of a reconfigurable synchronized dataflow processor (RSDP). The RSDP can configure its hardware to directly represent dataflow ...
143
click to vote
CG
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
150
Voted
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
190
Voted
IJCAI
1989
15 years 5 months ago
1989
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
138
Voted
ICST
2009
IEEE
15 years 10 months ago
2009
IEEE
Java PathFinder (JPF) is a popular model checker for Java programs. JPF was used to generate object graphs as test inputs for object-oriented programs. Specifically, JPF was used...