Sciweavers

3320 search results - page 44 / 664
» Heuristics for the Phylogeny Problem
Sort
View
IJMC
2006
84views more  IJMC 2006»
13 years 10 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 9 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
ECAI
2010
Springer
13 years 11 months ago
Strengthening Landmark Heuristics via Hitting Sets
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
Blai Bonet, Malte Helmert
ISSS
1996
IEEE
122views Hardware» more  ISSS 1996»
14 years 2 months ago
Modeling Multicomputer Task Allocation as a Vector Packing Problem
This paper considers the problem of task allocation for embedded, bus
James E. Beck, Daniel P. Siewiorek
AAAI
1997
13 years 11 months ago
Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
Aaron A. Armstrong, Edmund H. Durfee