388 search results - page 17 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
SIAMIS
2008
14 years 11 months ago
2008
This paper introduces a new approach to the problem of quantitative reconstruction of an object from few radiographic views. A mixed variable programming problem is formulated in ...
AAAI
1998
15 years 1 months ago
1998
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...
RTSS
1998
IEEE
15 years 3 months ago
1998
IEEE
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities....
102
click to vote
SIAMNUM
2010
14 years 6 months ago
2010
Abstract. We introduce hybridization and postprocessing techniques for the RaviartThomas approximation of second-order elliptic eigenvalue problems. Hybridization reduces the Ravia...
103
click to vote
AAAI
2007
15 years 2 months ago
2007
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...