Sciweavers

3221 search results - page 433 / 645
» Termination of Linear Programs
Sort
View
ICALP
2007
Springer
16 years 19 days ago
Perfect Information Stochastic Priority Games
We introduce stochastic priority games — a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority ga...
Hugo Gimbert, Wieslaw Zielonka
NETCOOP
2007
Springer
16 years 18 days ago
A New Necessary Condition for Shortest Path Routing
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
Mats Petter Pettersson, Krzysztof Kuchcinski
REFSQ
2007
Springer
16 years 17 days ago
Integrated Requirement Selection and Scheduling for the Release Planning of a Software Product
This paper investigates two integer linear programming models that integrate requirement scheduling into software release planning. The first model can schedule the development of ...
C. Li, J. M. van den Akker, Sjaak Brinkkemper, Gui...
WADS
2007
Springer
121views Algorithms» more  WADS 2007»
16 years 17 days ago
Cauchy's Theorem and Edge Lengths of Convex Polyhedra
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
16 years 17 days ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...