Sciweavers

3049 search results - page 232 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICST
2009
IEEE
16 years 1 months ago
Optimizing Generation of Object Graphs in Java PathFinder
Java PathFinder (JPF) is a popular model checker for Java programs. JPF was used to generate object graphs as test inputs for object-oriented programs. Specifically, JPF was used...
Milos Gligoric, Tihomir Gvero, Steven Lauterburg, ...
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
16 years 2 days ago
Identifying valid solutions for the inference of regulatory networks
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. The problem often is multi-modal and therefore appropriate optimi...
Christian Spieth, Felix Streichert, Nora Speer, An...
SIGDIAL
2010
15 years 4 months ago
Sparse Approximate Dynamic Programming for Dialog Management
Spoken dialogue management strategy optimization by means of Reinforcement Learning (RL) is now part of the state of the art. Yet, there is still a clear mismatch between the comp...
Senthilkumar Chandramohan, Matthieu Geist, Olivier...
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
16 years 17 days ago
Optimal Trajectory Generation for Manipulator Robots under Thermal Constraints
We propose here to deal with the optimization of velocity profiles of manipulator robots with a minimum time criterion subject to thermal constraints. This paper deals with the r...
Matthieu Guilbert, Pierre-Brice Wieber, Luc D. Jol...
JAIR
2006
143views more  JAIR 2006»
15 years 6 months ago
Convexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
Tom Heskes