7129 search results - page 801 / 1426 » Approximation Algorithms for Treewidth |
170
click to vote
AAAI
2010
15 years 8 months ago
2010
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
176
click to vote
IJCAI
2007
15 years 8 months ago
2007
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
164
click to vote
IPCO
2007
15 years 8 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
178
click to vote
MVA
2007
15 years 8 months ago
2007
This paper presents a new approach to extracting and representing structural features of images. The approach is based on both a region-based analysis and a contour-based analysis...
138
click to vote
NIPS
2007
15 years 8 months ago
2007
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...