447 search results - page 10 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
MOC
2000
13 years 7 months ago
2000
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...
CP
2003
Springer
14 years 18 days ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
AAAI
2004
13 years 8 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by investigating the interaction between network lifetime max...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...