435 search results - page 43 / 87 » Partitioning Search Spaces of a Randomized Search |
AIEDAM
2000
14 years 9 months ago
2000
In designing a state space of possible designs is implied by the representation used and the computational processes that operate on that representation. GAs are a means of effect...
100
click to vote
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Many robot control problems of practical importance, including operational space control, can be reformulated as immediate reward reinforcement learning problems. However, few of ...
187
click to vote
VLDB
2006
ACM
15 years 10 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
ALGORITHMICA
2005
14 years 9 months ago
2005
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
ICML
1994
IEEE
15 years 1 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...