Sciweavers

158 search results - page 4 / 32
» Local search for distributed asymmetric optimization
Sort
View
CP
2006
Springer
13 years 11 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
ICS
2005
Tsinghua U.
14 years 1 months ago
Think globally, search locally
A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which...
Kamen Yotov, Keshav Pingali, Paul Stodghill
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 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
ATAL
2007
Springer
14 years 1 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
PVM
2004
Springer
14 years 27 days ago
Neighborhood Composition: A Parallelization of Local Search Algorithms
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Mas...