5316 search results - page 884 / 1064 » Which Search Problems Are Random |
143
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
128
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
125
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
165
click to vote
WCNC
2008
IEEE
15 years 10 months ago
2008
IEEE
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
162
click to vote
DIALM
2005
ACM
15 years 6 months ago
2005
ACM
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...