2957 search results - page 332 / 592 » The Complexity of Polynomial-Time Approximation |
141
click to vote
ICRA
2006
IEEE
16 years 19 days ago
2006
IEEE
— Due to the abundant application background, the optimization of maintenance problem has been extensively studied in the past decades. Besides the well-known difficulty of larg...
152
click to vote
FOCS
2005
IEEE
16 years 6 days ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
203
click to vote
SI3D
2005
ACM
16 years 5 days ago
2005
ACM
We present a sampling strategy and rendering framework for intersectable models, whose surface is implicitly defined by a black box intersection test that provides the location a...
191
click to vote
EMMCVPR
2005
Springer
16 years 4 days ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
200
Voted
AMAI
2004
Springer
16 years 8 hour ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...