Sciweavers

962 search results - page 26 / 193
» Near-optimal solutions for the generalized max-controlled se...
Sort
View
ECAI
2010
Springer
14 years 11 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng
ATMOS
2007
177views Optimization» more  ATMOS 2007»
14 years 11 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
DATE
2005
IEEE
97views Hardware» more  DATE 2005»
15 years 3 months ago
Efficient Solution of Language Equations Using Partitioned Representations
A class of discrete event synthesis problems can be reduced to solving language equations F • X ⊆ S, where F is the fixed component and S the specification. Sequential synthes...
Alan Mishchenko, Robert K. Brayton, Jie-Hong Rolan...
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
15 years 3 months 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...
FCT
2009
Springer
15 years 4 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad