Sciweavers

2636 search results - page 159 / 528
» Linear Programming
Sort
View
IJCAI
2007
14 years 11 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
77
Voted
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
14 years 10 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler
78
Voted
TEC
1998
106views more  TEC 1998»
14 years 9 months ago
Combining mutation operators in evolutionary programming
Abstract— Traditional investigations with evolutionary programming (EP) for continuous parameter optimization problems have used a single mutation operator with a parameterized p...
Kumar Chellapilla
93
Voted
OL
2011
177views Neural Networks» more  OL 2011»
14 years 1 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann
103
Voted
ESOP
2009
Springer
15 years 5 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell