3874 search results - page 461 / 775 » Approximation Algorithms for k-hurdle Problems |
176
click to vote
IWPEC
2004
Springer
15 years 11 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
199
click to vote
ICIP
1999
IEEE
15 years 10 months ago
1999
IEEE
Optical diffusion tomography attempts to reconstruct an object cross section from measurements of scattered and attenuated light. While Bayesian approaches are well suited to this...
158
click to vote
COSIT
1995
Springer
15 years 9 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
163
click to vote
UAI
2008
15 years 7 months ago
2008
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
152
click to vote
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...