9325 search results - page 392 / 1865 » The decentralized implementability problem |
146
click to vote
CAV
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
140
click to vote
RTCSA
2000
IEEE
15 years 9 months ago
2000
IEEE
Although an optimistic approach has been shown to be better suited than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and h...
140
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
221
click to vote
ICSC
1999
Springer
15 years 9 months ago
1999
Springer
The Internet has evolved from an information space to a market space with thousands of electronic storefronts, auctions and other commercial services. This market space is not with...
132
click to vote
ICDCS
1998
IEEE
15 years 9 months ago
1998
IEEE
Market mechanisms solve distributed scheduling problems by allocating the scheduled resources according to market prices. We model distributed scheduling as a discrete resource al...