Sciweavers

84 search results - page 10 / 17
» Pruning State Spaces with Extended Beam Search
Sort
View
PVLDB
2010
152views more  PVLDB 2010»
13 years 6 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
ICTAI
2005
IEEE
14 years 1 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 6 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise
AAAI
2006
13 years 9 months ago
Decision Tree Methods for Finding Reusable MDP Homomorphisms
straction is a useful tool for agents interacting with environments. Good state abstractions are compact, reuseable, and easy to learn from sample data. This paper and extends two...
Alicia P. Wolfe, Andrew G. Barto
DAGSTUHL
2006
13 years 9 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga