4926 search results - page 411 / 986 » Two Graph Algorithms On an Associative Computing Model |
152
click to vote
TACAS
2010
Springer
15 years 2 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
127
click to vote
FOCS
1997
IEEE
15 years 8 months ago
1997
IEEE
The problem of maintaining data that arrives continuously over time is increasingly prevalent in databases and digital libraries. Building on a model for sliding-window indices de...
113
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
125
click to vote
WSC
2007
15 years 6 months ago
2007
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
171
click to vote
ICPADS
1994
IEEE
15 years 8 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...