Sciweavers

5331 search results - page 151 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
AAAI
1997
14 years 11 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
ICTAI
2009
IEEE
14 years 7 months ago
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Emmanuel Rachelson, Patrick Fabiani, Fréd&e...
ECCV
2008
Springer
15 years 12 months ago
Contour Context Selection for Object Detection: A Set-to-Set Contour Matching Approach
Abstract. We introduce a shape detection framework called Contour Context Selection for detecting objects in cluttered images using only one exemplar. Shape based detection is inva...
Qihui Zhu, Liming Wang, Yang Wu, Jianbo Shi
FCCM
2006
IEEE
111views VLSI» more  FCCM 2006»
15 years 4 months ago
Pipelined Mixed Precision Algorithms on FPGAs for Fast and Accurate PDE Solvers from Low Precision Components
FPGAs are becoming more and more attractive for high precision scientific computations. One of the main problems in efficient resource utilization is the quadratically growing r...
Robert Strzodka, Dominik Göddeke
GECCO
2006
Springer
220views Optimization» more  GECCO 2006»
15 years 1 months ago
Comparing evolutionary algorithms on the problem of network inference
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...
Christian Spieth, Rene Worzischek, Felix Streicher...