Sciweavers

10901 search results - page 303 / 2181
» Approximations in Distributed Optimization
Sort
View
CSDA
2010
132views more  CSDA 2010»
15 years 6 months ago
Approximate low-rank factorization with structured factors
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
Ivan Markovsky, Mahesan Niranjan
ICASSP
2010
IEEE
15 years 6 months ago
Approximate nearest neighbors using sparse representations
A new method is introduced that makes use of sparse image representations to search for approximate nearest neighbors (ANN) under the normalized inner-product distance. The approa...
Joaquin Zepeda, Ewa Kijak, Christine Guillemot
TR
2010
126views Hardware» more  TR 2010»
15 years 1 months ago
Approximating a Loading-Dependent Cascading Failure Model With a Branching Process
Abstract--We quantify the closeness of the approximation between two high-level probabilistic models of cascading failure. In one model called CASCADE, failing components successiv...
Janghoon Kim, Ian Dobson
IAT
2005
IEEE
16 years 8 days ago
Decomposing Large-Scale POMDP Via Belief State Analysis
Partially observable Markov decision process (POMDP) is commonly used to model a stochastic environment with unobservable states for supporting optimal decision making. Computing ...
Xin Li, William K. Cheung, Jiming Liu
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
15 years 10 months ago
Coevolution of neural networks using a layered pareto archive
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
German A. Monroy, Kenneth O. Stanley, Risto Miikku...