Sciweavers

732 search results - page 90 / 147
» Termination of Integer Linear Programs
Sort
View
SIAMJO
2008
97views more  SIAMJO 2008»
13 years 9 months ago
New Formulations for Optimization under Stochastic Dominance Constraints
Stochastic dominance constraints allow a decision-maker to manage risk in an optimization setting by requiring their decision to yield a random outcome which stochastically domina...
James Luedtke
SIGARCH
2008
94views more  SIGARCH 2008»
13 years 9 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
TKDE
2008
121views more  TKDE 2008»
13 years 9 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
13 years 8 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram
MIG
2010
Springer
13 years 7 months ago
Path Planning for Groups Using Column Generation
In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a ...
Marjan van den Akker, Roland Geraerts, Han Hoogeve...