Sciweavers

1402 search results - page 44 / 281
» Searching Cycle-Disjoint Graphs
Sort
View
CI
1998
78views more  CI 1998»
14 years 9 months ago
Pattern Databases
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....
Joseph C. Culberson, Jonathan Schaeffer
ICASSP
2011
IEEE
14 years 1 months ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney
TKDE
2002
239views more  TKDE 2002»
14 years 9 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik
TCS
2012
13 years 5 months ago
Improved simulation of nondeterministic Turing machines
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...
Subrahmanyam Kalyanasundaram, Richard J. Lipton, K...
AIPS
2000
14 years 11 months ago
Planning with Reduced Operator Sets
Classical propositional STRIPSplanning is nothing but the searchfor a path in the state-transition graph induced by the operators in the planning problem. Whatmakes the problem ha...
Patrik Haslum, Peter Jonsson