7129 search results - page 867 / 1426 » Approximation Algorithms for Treewidth |
161
Voted
DAGSTUHL
2004
15 years 7 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
168
click to vote
GRAPHICSINTERFACE
2004
15 years 7 months ago
2004
We present a novel algorithm for accurate, high quality point rendering, which is based on the formulation of splatting using homogeneous coordinates. In contrast to previous meth...
138
Voted
IJIT
2004
15 years 7 months ago
2004
A novel method of learning complex fuzzy decision regions in the n-dimensional feature space is proposed. Through the fuzzy decision regions, a given pattern's class membershi...
160
click to vote
IJCAI
2001
15 years 7 months ago
2001
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
152
Voted
IJCAI
2003
15 years 7 months ago
2003
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...