Sciweavers

3514 search results - page 46 / 703
» A search space
Sort
View
IJCAI
2003
13 years 10 months ago
Sampling Combinatorial Spaces Using Biased Random Walks
For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can ...
Jordan Erenrich, Bart Selman
RSFDGRC
1999
Springer
135views Data Mining» more  RSFDGRC 1999»
14 years 1 months ago
The Iterated Version Space Learning
Inspired with Version Space learning, the Iterated Version Space Algorithm (IVSA) has been designed and implemented to learn disjunctive concepts. IVSA dynamically partitions its s...
Jianna Jian Zhang, Nick Cercone
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 9 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
IAT
2009
IEEE
14 years 3 months ago
CubanSea: Cluster-Based Visualization of Search Results
—In recent years, there has been a move toward supporting the human element of Web search beyond a simple query box and a ranked list of search results. In this paper, we present...
Matthias Tilsner, Orland Hoeber, Adrian Fiech
ECAIW
2000
Springer
14 years 1 months ago
Board-Laying Techniques Improve Local Search in Mixed Planning and Scheduling
When searching the space of possible plans for combined planning and scheduling problems we often reach a local maximum and must either backtrack or otherwise modify the plan to m...
Russell Knight, Gregg Rabideau, Steve A. Chien