Sciweavers

13376 search results - page 441 / 2676
» Problem Solving with
Sort
View
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
15 years 8 months ago
Overcoming hierarchical difficulty by hill-climbing the building block structure
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
David Iclanzan, Dan Dumitrescu
DAC
2010
ACM
15 years 6 months ago
An efficient dual algorithm for vectorless power grid verification under linear current constraints
Vectorless power grid verification makes it possible to evaluate worst-case voltage drops without enumerating possible current waveforms. Under linear current constraints, the vec...
Xuanxing Xiong, Jia Wang
JMLR
2012
13 years 7 months ago
Primal-Dual methods for sparse constrained matrix completion
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
Yu Xin, Tommi Jaakkola
ISPEC
2009
Springer
15 years 11 months ago
Strongly Unforgeable ID-Based Signatures without Random Oracles
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles.4 The signature size of our scheme is smaller than that of other schemes based o...
Chifumi Sato, Takeshi Okamoto, Eiji Okamoto
NIPS
2007
15 years 6 months ago
Random Sampling of States in Dynamic Programming
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
Christopher G. Atkeson, Benjamin Stephens