1274 search results - page 117 / 255 » N-fold integer programming |
110
click to vote
COCO
2006
Springer
15 years 6 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
102
click to vote
ISSS
1995
IEEE
15 years 6 months ago
1995
IEEE
{DSP algorithms in most cases are subject to hard real-time constraints. In case of programmable DSP processors, meeting those constraints must be ensured by appropriate code gener...
125
Voted
CIS
2008
Springer
15 years 4 months ago
2008
Springer
Delivering continuous services in information infrastructures is a major challenge. For system or network administrators, redundancy allocation is one of the best strategies to en...
145
Voted
AAAI
2000
15 years 3 months ago
2000
We propose a novel algorithmic framework to solve an integrated planning and scheduling problem in supply chain management. This problem involves the integration of an inventory m...
131
Voted
WCET
2003
15 years 3 months ago
2003
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...