Sciweavers

4488 search results - page 84 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
COCOA
2010
Springer
15 years 1 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
VLDB
2000
ACM
166views Database» more  VLDB 2000»
15 years 6 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
ACG
2006
Springer
15 years 9 months ago
Solving Probabilistic Combinatorial Games
Probabilistic combinatorial games (PCG) are a model for Go-like games recently introduced by Ken Chen. They differ from normal combinatorial games since terminal position in each ...
Ling Zhao, Martin Müller 0003
116
Voted
GECCO
2008
Springer
142views Optimization» more  GECCO 2008»
15 years 4 months ago
Complexity of Max-SAT using stochastic algorithms
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
Mohamed Qasem, Adam Prügel-Bennett
PRICAI
2010
Springer
15 years 1 months ago
Exploiting Symmetry in Relational Similarity for Ranking Relational Search Results
Relational search is a novel paradigm of search which focuses on the similarity between semantic relations. Given three words (A, B, C) as the query, a relational search engine ret...
Tomokazu Goto, Nguyen Tuan Duc, Danushka Bollegala...