Sciweavers

481 search results - page 15 / 97
» Anytime Local Search for Distributed Constraint Optimization
Sort
View
DCOSS
2005
Springer
14 years 4 months ago
A Local Facility Location Algorithm for Sensor Networks
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
Denis Krivitski, Assaf Schuster, Ran Wolff
TEC
2002
163views more  TEC 2002»
13 years 10 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
ICS
2005
Tsinghua U.
14 years 4 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 12 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
ICASSP
2008
IEEE
14 years 5 months ago
Time-frequency localization from sparsity constraints
In the case of multicomponent AM-FM signals, the idealized representation which consists of weighted trajectories on the time-frequency (TF) plane, is intrinsically sparse. Recent...
Pierre Borgnat, Patrick Flandrin