Sciweavers

481 search results - page 27 / 97
» Anytime Local Search for Distributed Constraint Optimization
Sort
View
SAC
2005
ACM
15 years 3 months ago
A multi-agent approach for solving optimization problems involving expensive resources
In this paper, we propose a multi-agent approach for solving a class of optimization problems involving expensive resources, where monolithic local search schemes perform miserabl...
Hoong Chuin Lau, Hui Wang
SIGMOD
2010
ACM
232views Database» more  SIGMOD 2010»
14 years 10 months ago
Optimizing content freshness of relations extracted from the web using keyword search
An increasing number of applications operate on data obtained from the Web. These applications typically maintain local copies of the web data to avoid network latency in data acc...
Mohan Yang, Haixun Wang, Lipyeow Lim, Min Wang
EOR
2008
200views more  EOR 2008»
14 years 10 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
14 years 5 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens
ECAI
2000
Springer
15 years 1 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon