Sciweavers

2266 search results - page 204 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
ICARIS
2010
Springer
15 years 1 months ago
A Developmental and Immune-Inspired Dynamic Task Allocation Algorithm for Microprocessor Array Systems
Abstract. This paper presents a high level dynamic task allocation algorithm that is inspired by the biological development process and the immune system. For a microprocessor (µP...
Yang Liu, Jon Timmis, Omer Qadir, Gianluca Tempest...
FSTTCS
1993
Springer
15 years 7 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
FLAIRS
2004
15 years 4 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
ECAI
2006
Springer
15 years 6 months ago
Random Subset Optimization
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
Boi Faltings, Quang Huy Nguyen
ADHOCNOW
2008
Springer
15 years 9 months ago
Request Satisfaction Problem in Synchronous Radio Networks
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
Benoît Darties, Sylvain Durand, Jér&o...