Sciweavers

1159 search results - page 215 / 232
» Binary Decision Graphs
Sort
View
IJCAI
1989
13 years 9 months ago
Preprocessing Search Spaces for Branch and Bound Search
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...
Qiang Yang, Dana S. Nau
ATAL
2010
Springer
13 years 8 months ago
Image based exploration for indoor environments using local features
d Abstract) Aravindhan K Krishnan Madhava Krishna Supreeth Achar This paper presents an approach to explore an unknown indoor environment using vision as the sensing modality, t...
Aravindhan K. Krishnan, K. Madhava Krishna, Supree...
TCS
2008
13 years 7 months ago
Distance- k knowledge in self-stabilizing algorithms
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
Wayne Goddard, Stephen T. Hedetniemi, David Pokras...
AI
2002
Springer
13 years 7 months ago
Coherence in finite argument systems
Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two imp...
Paul E. Dunne, Trevor J. M. Bench-Capon
PRL
2002
91views more  PRL 2002»
13 years 7 months ago
StrCombo: combination of string recognizers
In this paper, we contribute a new paradigm of combining string recognizers and propose generic frameworks for hierarchical and parallel combination of multiple string recognizers...
Xiangyun Ye, Mohamed Cheriet, Ching Y. Suen