Sciweavers

3055 search results - page 168 / 611
» Randomized Search Trees
Sort
View
111
Voted
CORR
2012
Springer
229views Education» more  CORR 2012»
13 years 8 months ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
84
Voted
SAC
2005
ACM
15 years 6 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
116
Voted
DASFAA
2006
IEEE
152views Database» more  DASFAA 2006»
15 years 6 months ago
Effective Keyword Search in XML Documents Based on MIU
Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data....
Jianjun Xu, Jiaheng Lu, Wei Wang 0009, Baile Shi
102
Voted
MEDINFO
2007
124views Healthcare» more  MEDINFO 2007»
15 years 2 months ago
Experiments with Hierarchical Concept-Based Search
Many digital libraries use hierarchical indexing schema, such as MeSH to enable concept based search in the retrieval phase. However, improving or outperforming the traditional fu...
Robert Moskovitch, Roee Sa'adon, Eytan Behiri, Sus...
AAAI
2006
15 years 2 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter