5316 search results - page 246 / 1064 » Which Search Problems Are Random |
127
click to vote
JAIR
2006
15 years 4 months ago
2006
Real-time search methods are suited for tasks in which the agent is interacting with an initially unknown environment in real time. In such simultaneous planning and learning prob...
130
click to vote
TCS
2008
15 years 4 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
164
click to vote
AAAI
2010
15 years 6 months ago
2010
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
128
click to vote
CEC
2005
IEEE
15 years 10 months ago
2005
IEEE
AbstractThis paper presents a real-coded memetic algorithm that combines a high diversity global exploration with an adaptive local search method to the most promising individuals ...
133
Voted
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...