Sciweavers

16596 search results - page 234 / 3320
» Generalized Assignment Problems
Sort
View
ICALP
2010
Springer
15 years 11 months ago
Preprocessing of Min Ones Problems: A Dichotomy
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
Stefan Kratsch, Magnus Wahlström
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 10 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
WSC
2008
15 years 8 months ago
Simulation-based optimization for the quay crane scheduling problem
Maritime terminals of pure transhipment are emerging logistic realities in long-distance containerized trade. Here, complex activities of resource allocation and scheduling should...
Pasquale Legato, Rina Mary Mazza, Roberto Trunfio
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
15 years 6 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
TCSV
2010
15 years 1 months ago
Solving Streaming Capacity Problems in P2P VoD Systems
Abstract--Peer-to-peer (P2P) video-on-demand (VoD) is a popular Internet service for a large number of concurrent users. Streaming capacity in a P2P VoD system is defined as the ma...
Yifeng He, Ling Guan