Sciweavers

605 search results - page 37 / 121
» Probabilistic state space search
Sort
View
DAGSTUHL
2007
13 years 9 months ago
Logical Particle Filtering
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
Luke S. Zettlemoyer, Hanna M. Pasula, Leslie Pack ...
CCGRID
2004
IEEE
13 years 11 months ago
Search performance analysis and robust search algorithm in unstructured peer-to-peer networks
Recently Peer-to-Peer networks (P2P) have gained great attention and popularity. One key challenging aspect in a P2P resource sharing environment is an efficient searching algorit...
Tsungnan Lin, Hsinping Wang, Jianming Wang
AAAI
2010
13 years 9 months ago
SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs
The results of the latest International Probabilistic Planning Competition (IPPC-2008) indicate that the presence of dead ends, states with no trajectory to the goal, makes MDPs h...
Andrey Kolobov, Mausam, Daniel S. Weld
ACRI
2006
Springer
14 years 1 months ago
Optimal 6-State Algorithms for the Behavior of Several Moving Creatures
The goal of our investigation is to find automatically the absolutely best rule for a moving creature in a cellular field. The task of the creature is to visit all empty cells wi...
Mathias Halbach, Rolf Hoffmann, Lars Both
GLVLSI
2005
IEEE
85views VLSI» more  GLVLSI 2005»
14 years 1 months ago
Utilizing don't care states in SAT-based bounded sequential problems
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
Sean Safarpour, Görschwin Fey, Andreas G. Ven...