Sciweavers

899 search results - page 46 / 180
» Advancements in multicode optimization
Sort
View
AAAI
2006
15 years 3 months ago
Learning Basis Functions in Hybrid Domains
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
GECCO
2008
Springer
111views Optimization» more  GECCO 2008»
15 years 2 months ago
Computational scenario-based capability planning
Scenarios are pen-pictures of plausible futures, used for strategic planning. The aim of this investigation is to expand the horizon of scenario-based planning through computation...
Hussein A. Abbass, Axel Bender, Hai Huong Dam, Ste...
SIAMIS
2011
14 years 8 months ago
Large Scale Bayesian Inference and Experimental Design for Sparse Linear Models
Abstract. Many problems of low-level computer vision and image processing, such as denoising, deconvolution, tomographic reconstruction or superresolution, can be addressed by maxi...
Matthias W. Seeger, Hannes Nickisch
ICIP
2009
IEEE
16 years 2 months ago
Fast Block Based Connected Components Labeling
In this paper we present a new optimization technique for the neighborhood computation in connected component labeling focused on images stored in raster scan order. This new tech...
ICLP
2007
Springer
15 years 7 months ago
Logic Programming Approach to Automata-Based Decision Procedures
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...
Gulay Ünel, David Toman