Sciweavers

975 search results - page 47 / 195
» Locality Optimization for Program Instances
Sort
View
JCO
2007
123views more  JCO 2007»
14 years 9 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
JALC
2006
125views more  JALC 2006»
14 years 9 months ago
A Confinement Criterion for Securely Executing Mobile Code
Mobile programs, like applets, are not only ubiquitous, but also potentially malicious. We study the case where mobile programs are executed by a host system in a secured environm...
Hervé Grall
CEC
2010
IEEE
14 years 10 months ago
Parallel hybrid evolutionary algorithms on GPU
Abstract— Over the last years, interest in hybrid metaheuristics has risen considerably in the field of optimization. Combinations of methods such as evolutionary algorithms and...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
ICASSP
2009
IEEE
15 years 4 months ago
Ranging energy optimization for robust sensor positioning
We address ranging energy optimization for an unsynchronized localization system, which features robust sensor positioning, in the sense that specific accuracy requirements are f...
Tao Wang, Geert Leus, Dries Neirynck, Feng Shu, Li...
AI
1999
Springer
14 years 9 months ago
Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
Holger H. Hoos, Thomas Stützle