550 search results - page 47 / 110 » Optimization and Approximation Problems Related to Polynomia... |
HYBRID
2007
Springer
14 years 3 months ago
2007
Springer
This work investigates some of the computational issues involved in the solution of probabilistic reachability problems for discretetime, controlled stochastic hybrid systems. It i...
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
HYBRID
1999
Springer
14 years 1 months ago
1999
Springer
In this work we tackle the following problem: given a timed automaton, and a target set F of configurations, restrict its transition relation in a systematic way so that from ever...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...