Sciweavers

1996 search results - page 180 / 400
» Financial Theory 2
Sort
View
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 6 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
CLA
2004
15 years 6 months ago
Using Concept Formal Analysis for Cooperative Information Retrieval
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...
Ibtissem Nafkha, Samir Elloumi, Ali Jaoua
NIPS
2000
15 years 6 months ago
High-temperature Expansions for Learning Models of Nonnegative Data
Recent work has exploited boundedness of data in the unsupervised learning of new types of generative model. For nonnegative data it was recently shown that the maximum-entropy ge...
Oliver B. Downs
NIPS
1994
15 years 6 months ago
Reinforcement Learning with Soft State Aggregation
It is widely accepted that the use of more compact representations than lookup tables is crucial to scaling reinforcement learning (RL) algorithms to real-world problems. Unfortun...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...
ATAL
2010
Springer
15 years 5 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson