1647 search results - page 222 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
123
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
116
click to vote
AAAI
2007
15 years 4 months ago
2007
We describe a point-based policy iteration (PBPI) algorithm for infinite-horizon POMDPs. PBPI replaces the exact policy improvement step of Hansen’s policy iteration with point...
124
click to vote
PAKDD
2010
ACM
15 years 8 days ago
2010
ACM
Data mining tasks results are usually improved by reducing the dimensionality of data. This improvement however is achieved harder in the case that data lay on a non linear manifol...
123
click to vote
3DPVT
2006
IEEE
15 years 8 months ago
2006
IEEE
We present an algorithm for generating panoramic images of complex scenes from a multi-sensor camera. We further present a programmable graphics hardware implementation to process...
104
Voted
CSCLP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...