Sciweavers

464 search results - page 7 / 93
» Distributed Constraint-Based Local Search
Sort
View
ATAL
2007
Springer
14 years 2 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee
IPPS
2006
IEEE
14 years 1 months ago
Parallel multiple sequence alignment with local phylogeny search by simulated annealing
The problem of multiple sequence alignment is one of the most important problems in computational biology. In this paper we present a new method that simultaneously performs multi...
Jaroslaw Zola, Denis Trystram, Andrei Tchernykh, C...
INFOSCALE
2007
ACM
13 years 9 months ago
A distributed incremental nearest neighbor algorithm
Searching for non-text data (e.g., images) is mostly done by means of metadata annotations or by extracting the text close to the data. However, supporting real content-based audi...
Fabrizio Falchi, Claudio Gennaro, Fausto Rabitti, ...
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 9 months ago
Allocation of local and global search capabilities of particle in canonical PSO
This paper analyzes theoretically the exact sampling distribution of the particle swarm optimization (PSO) without any assumption imposed by all current analyses. The distribution...
Junqi Zhang, Kun Liu, Ying Tan, Xingui He
AIMSA
2008
Springer
13 years 10 months ago
A Hybrid Approach to Distributed Constraint Satisfaction
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
David Lee, Inés Arana, Hatem Ahriz, Kit-Yin...