Sciweavers

421 search results - page 10 / 85
» Exact and Heuristic Algorithms for the Weapon-Target Assignm...
Sort
View
EOR
2006
120views more  EOR 2006»
13 years 7 months ago
Approximate and exact algorithms for the fixed-charge knapsack problem
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Umit Akinc
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
14 years 1 months ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
14 years 6 days ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
RECOMB
2005
Springer
14 years 8 months ago
Reversals of Fortune
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...
David Sankoff, Chunfang Zheng, Aleksander Lenert
INFOCOM
2007
IEEE
14 years 1 months ago
The Power Balancing Problem in Energy Constrained Multi-Hop Wireless Networks
— Power efficient operation is very critical in energy constrained multi-hop wireless networks. One important technique is to intelligently assign transmission powers to nodes w...
Randeep Bhatia, Abhishek Kashyap, Erran L. Li