1707 search results - page 151 / 342 » Early Integer Programming |
102
Voted
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...
124
click to vote
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
click to vote
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
click to vote
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...
127
Voted
ENDM
2010
15 years 2 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...