Sciweavers

1723 search results - page 122 / 345
» Cycling in linear programming problems
Sort
View
COMCOM
2010
150views more  COMCOM 2010»
14 years 10 months ago
Convergence of trajectories and optimal buffer sizing for MIMD congestion control
We study the interaction between the MIMD (Multiplicative Increase Multiplicative Decrease) congestion control and a bottleneck router with Drop Tail buffer. We consider the probl...
Yi Zhang, Alexei B. Piunovskiy, Urtzi Ayesta, Kons...
GECCO
2005
Springer
162views Optimization» more  GECCO 2005»
15 years 3 months ago
Discovering biological motifs with genetic programming
Choosing the right representation for a problem is important. In this article we introduce a linear genetic programming approach for motif discovery in protein families, and we al...
Rolv Seehuus, Amund Tveit, Ole Edsberg
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
14 years 10 months ago
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
CP
2009
Springer
15 years 10 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
CORR
2010
Springer
119views Education» more  CORR 2010»
14 years 10 months ago
Dynamic Policy Programming
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
Mohammad Gheshlaghi Azar, Hilbert J. Kappen