Sciweavers

3946 search results - page 420 / 790
» The computational complexity of choice sets
Sort
View
ATAL
2005
Springer
16 years 1 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
MIDDLEWARE
2004
Springer
16 years 29 days ago
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
Márk Jelasity, Rachid Guerraoui, Anne-Marie...
SAINT
2003
IEEE
16 years 26 days ago
A Generalized Target-Driven Cache Replacement Policy for Mobile Environments
Caching frequently accessed data items on the client side is an effective technique to improve the system performance in wireless networks. Due to cache size limitations, cache re...
Liangzhong Yin, Guohong Cao, Ying Cai
ICDE
1993
IEEE
158views Database» more  ICDE 1993»
15 years 11 months ago
Unification of Temporal Data Models
To add time su port to the relational model, both first normal form (fNF and non-INF appmches have maining within 1NF when time support is added may introduce data redundancy. The...
Christian S. Jensen, Michael D. Soo, Richard T. Sn...
ATAL
2008
Springer
15 years 9 months ago
Aligning social welfare and agent preferences to alleviate traffic congestion
Multiagent coordination algorithms provide unique insights into the challenging problem of alleviating traffic congestion. What is particularly interesting in this class of proble...
Kagan Tumer, Zachary T. Welch, Adrian K. Agogino