490 search results - page 83 / 98 » Practical Extensions to the IFDS Algorithm |
STOC
1999
ACM
14 years 1 months ago
1999
ACM
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
IWCMC
2010
ACM
13 years 10 months ago
2010
ACM
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...
TCAD
2008
13 years 8 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
EDBT
2008
ACM
14 years 9 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
Distributed constraint optimization (DCOP) provides a framework for coordinated decision making by a team of agents. Often, during the decision making, capacity constraints on age...