2035 search results - page 88 / 407 » Working memory |
122
click to vote
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
142
click to vote
FASE
2006
Springer
15 years 6 months ago
2006
Springer
One of the major costs of software development is associated with testing and validation of successive versions of software systems. An important problem encountered in testing and...
137
click to vote
ANCS
2009
ACM
15 years 29 days ago
2009
ACM
As the Internet grows, both the number of rules in packet filtering databases and the number of prefixes in IP lookup tables inside the router are growing. The packet processing e...
114
click to vote
ICPP
1999
IEEE
15 years 7 months ago
1999
IEEE
We study the problem of exploiting parallelism from search-based AI systems on distributed machines. We propose stack-splitting, a technique for implementing orparallelism, which ...
167
click to vote
PPOPP
2006
ACM
15 years 9 months ago
2006
ACM
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...