14642 search results - page 204 / 2929 » It's Time for a Change |
175
click to vote
IJCAI
1993
15 years 8 months ago
1993
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
159
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper, we present two new run-time algorithms for the parallelization of loops that have indirect access patterns. The algorithms can handle any type of loop-carried depen...
179
click to vote
SENSYS
2010
ACM
15 years 4 months ago
2010
ACM
Ecologists instrument ecosystems to collect time series representing the evolution in time and space of relevant abiotic and biotic factors. Sensor networks promise to improve on ...
179
click to vote
STOC
1999
ACM
15 years 11 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 ...
170
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...