29046 search results - page 5452 / 5810 » Computable Models |
181
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
198
Voted
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
249
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
196
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...
182
click to vote
PERCOM
2007
ACM
16 years 6 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...