1515 search results - page 303 / 303 » Parallel computing on any desktop |
COCO
2003
Springer
13 years 12 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
ICML
1996
IEEE
14 years 7 months ago
1996
IEEE
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
PODC
2009
ACM
14 years 3 months ago
2009
ACM
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...
EUROSYS
2010
ACM
14 years 24 days ago
2010
ACM
The deluge of huge data sets such as those provided by
sensor networks, online transactions, and the web provide
exciting opportunities for data analysis. The scale of the
data ...
ISPA
2005
Springer
14 years 5 days ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...