Sciweavers

465 search results - page 7 / 93
» On the Hardness of Range Assignment Problems
Sort
View
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
15 years 1 months ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth
ATAL
2009
Springer
15 years 4 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
GECCO
2000
Springer
150views Optimization» more  GECCO 2000»
15 years 1 months ago
A Hybrid Genetic Algorithm for the Quadratic Assignment Problem
A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment Problem (QAP). The hybrid algorithm improves the result...
Manuel Vázquez, L. Darrell Whitley
CORR
2010
Springer
217views Education» more  CORR 2010»
14 years 4 months ago
Semi-Partitioned Hard Real-Time Scheduling with Restricted Migrations upon Identical Multiprocessor Platforms
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...
François Dorin, Patrick Meumeu Yomsi, Jo&eu...
INFOCOM
2007
IEEE
15 years 3 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