Sciweavers

435 search results - page 33 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
67
Voted
IROS
2006
IEEE
166views Robotics» more  IROS 2006»
15 years 3 months ago
Anytime RRTs
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
Dave Ferguson, Anthony Stentz
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
15 years 1 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
WWW
2005
ACM
15 years 10 months ago
A search engine for natural language applications
Many modern natural language-processing applications utilize search engines to locate large numbers of Web documents or to compute statistics over the Web corpus. Yet Web search e...
Michael J. Cafarella, Oren Etzioni
IDEAS
2003
IEEE
131views Database» more  IDEAS 2003»
15 years 3 months ago
Neighborhood Signatures for Searching P2P Networks
Overlay networks have received a lot of attention due to the recent wide-spread use of peer-to-peer (P2P) applications such as SETI, Napster, Gnutella, and Morpheus. Through repli...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam
COMAD
2009
14 years 10 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan