Sciweavers

2393 search results - page 366 / 479
» Bounds-Consistent Local Search
Sort
View
IJCAI
1989
13 years 10 months ago
A Probabilistic Approach to Marker Propagation
Potentially, the advantages of marker-passing over local connectionist techniques for associa­ tive inference are (1) the ability to differen­ tiate variable bindings, and (2) r...
Dekai Wu
AE
2009
Springer
13 years 10 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
ATAL
2010
Springer
13 years 10 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
ERCIMDL
2010
Springer
139views Education» more  ERCIMDL 2010»
13 years 10 months ago
User-Contributed Descriptive Metadata for Libraries and Cultural Institutions
: The Library of Congress and other cultural institutions are collecting highly informative user-contributed metadata as comments and notes expressing historical and factual inform...
Michael A. Zarro, Robert B. Allen
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
13 years 10 months ago
Hierarchical evolution of linear regressors
We propose an algorithm for function approximation that evolves a set of hierarchical piece-wise linear regressors. The algorithm, named HIRE-Lin, follows the iterative rule learn...
Francesc Teixidó-Navarro, Albert Orriols-Pu...