Sciweavers

4432 search results - page 25 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
HM
2009
Springer
165views Optimization» more  HM 2009»
14 years 2 months ago
Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search
Abstract. A Video-on-Demand system usually consists of a large number of independent video servers. In order to utilize network resources as efficiently as possible the overall net...
Jakob Walla, Mario Ruthmair, Günther R. Raidl
JAIR
2008
121views more  JAIR 2008»
13 years 9 months ago
A Constraint Programming Approach for Solving a Queueing Control Problem
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custom...
Daria Terekhov, J. Christopher Beck
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 7 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
IPPS
2008
IEEE
14 years 4 months ago
A genetic programming approach to solve scheduling problems with parallel simulation
—Scheduling and dispatching are two ways of solving production planning problems. In this work, based on preceding works, it is explained how these two approaches can be combined...
Andreas Beham, Stephan M. Winkler, Stefan Wagner 0...
PDPTA
1996
13 years 11 months ago
Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
Darrell R. Ulm, Johnnie W. Baker