941 search results - page 85 / 189 » The Parking Permit Problem |
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
TIME
2005
IEEE
15 years 5 months ago
2005
IEEE
We exploit the fact that qualitative Interval Algebra (IA) network problems are finite domain CSPs. In the first part of the paper, we show how to convert a qualitative IA network ...
KR
1992
Springer
15 years 4 months ago
1992
Springer
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
100
click to vote
EUROMICRO
2009
IEEE
15 years 3 months ago
2009
IEEE
The use of user specific virtual machines (VMs) in Grid and Cloud computing reduces the administration overhead associated with manually installing required software for every user...