2244 search results - page 344 / 449 » A new heuristic approach for non-convex optimization problem... |
162
Voted
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
211
Voted
ICCAD
2000
IEEE
15 years 10 months ago
2000
IEEE
ct Static timing analysis has traditionally used the PERT method for identifying the critical path of a digital circuit. Due to the influence of the slope of a signal at a particul...
211
Voted
ICANN
2005
Springer
16 years 15 days ago
2005
Springer
One aim of Meta-learning techniques is to minimize the time needed for problem solving, and the effort of parameter hand-tuning, by automating algorithm selection. The predictive m...
232
Voted
PAMI
2010
15 years 1 months ago
2010
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
190
click to vote
PPAM
2005
Springer
16 years 14 days ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...