Sciweavers

585 search results - page 101 / 117
» Better Abstractions for Timed Automata
Sort
View
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
15 years 1 months ago
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
Yves Pochet
ICNP
2000
IEEE
15 years 1 months ago
An Image Transport Protocol for the Internet
Images account for a significant and growing fraction of Web downloads. The traditional approach to transporting images uses TCP, which provides a generic reliable, in-order eam ...
Suchitra Raman, Hari Balakrishnan, Murari Srinivas...
ATC
2008
Springer
14 years 11 months ago
Scheduling for Reliable Execution in Autonomic Systems
Abstract. Scheduling the execution of multiple concurrent tasks on shared resources such as CPUs and network links is essential to ensuring the reliable operation of many autonomic...
Terry Tidwell, Robert Glaubius, Christopher D. Gil...
KI
2006
Springer
14 years 9 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler
MOR
2002
94views more  MOR 2002»
14 years 9 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel