Sciweavers

2636 search results - page 213 / 528
» Linear Programming
Sort
View
109
Voted
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 3 months ago
Polymorphic Fractional Capabilities
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
Hirotoshi Yasuoka, Tachio Terauchi
122
Voted
CC
2007
Springer
107views System Software» more  CC 2007»
15 years 8 months ago
A Fast Cutting-Plane Algorithm for Optimal Coalescing
Abstract. Recent work has shown that the subtasks of register allocation (spilling, register assignment, and coalescing) can be completely separated. This work presents an algorith...
Daniel Grund, Sebastian Hack
131
Voted
FSTTCS
2006
Springer
15 years 6 months ago
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
Chaitanya Swamy, David B. Shmoys
106
Voted
AAAI
2000
15 years 4 months ago
Structure, Duality, and Randomization: Common Themes in AI and OR
Both the Artificial Intelligence (AI) community and the Operations Research (OR) community are interested in developing techniques for solving hard combinatorial problems. OR has ...
Carla P. Gomes
149
Voted
MOR
2000
162views more  MOR 2000»
15 years 2 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan