3837 search results - page 360 / 768 » Learning Approximate Consistencies |
201
click to vote
PLDI
2003
ACM
16 years 3 days ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
260
click to vote
TON
2010
15 years 1 months ago
2010
TCP throughput prediction is an important capability in wide area overlay and multi-homed networks where multiple paths may exist between data sources and receivers. In this paper...
197
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Abstract. In many vision problems, the observed data lies in a nonlinear manifold in a high-dimensional space. This paper presents a generic modelling scheme to characterize the no...
184
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
174
Voted
AAAI
2010
15 years 8 months ago
2010
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...