Sciweavers

242 search results - page 36 / 49
» Exploration of a Two Sided Rendezvous Search Problem Using G...
Sort
View
113
Voted
NIPS
2007
15 years 5 months ago
A learning framework for nearest neighbor search
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
Lawrence Cayton, Sanjoy Dasgupta
202
Voted
IWCLS
2007
Springer
15 years 9 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull
154
Voted
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
15 years 7 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
122
Voted
AI
2008
Springer
15 years 3 months ago
Managing parallel inquiries in agents' two-sided search
In this paper we address the problem of agents engaged in a distributed costly two-sided search for pairwise partnerships in Multi-Agent Systems (MAS). While traditional two-sided...
David Sarne, Sarit Kraus
124
Voted
BMCBI
2007
165views more  BMCBI 2007»
15 years 3 months ago
Direct maximum parsimony phylogeny reconstruction from genotype data
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...