Sciweavers

1641 search results - page 216 / 329
» Termination Analysis with Algorithmic Learning
Sort
View
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
15 years 6 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
MM
2003
ACM
84views Multimedia» more  MM 2003»
15 years 5 months ago
Temporal event clustering for digital photo collections
We present similarity-based methods to cluster digital photos by time and image content. The approach is general, unsupervised, and makes minimal assumptions regarding the structu...
Matthew L. Cooper, Jonathan Foote, Andreas Girgens...
76
Voted
CACM
2010
105views more  CACM 2010»
15 years 18 days ago
Censored exploration and the dark pool problem
We introduce and analyze a natural algorithm for multi-venue exploration from censored data, which is motivated by the Dark Pool Problem of modern quantitative finance. We prove t...
Kuzman Ganchev, Yuriy Nevmyvaka, Michael Kearns, J...
103
Voted
JSSPP
2007
Springer
15 years 6 months ago
A Self-optimized Job Scheduler for Heterogeneous Server Clusters
Heterogeneous clusters and grid infrastructures are becoming increasingly popular. In these computing infrastructures, machines have different resources, including memory sizes, d...
Elad Yom-Tov, Yariv Aridor
118
Voted
SIGSOFT
2008
ACM
16 years 1 months ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren