Sciweavers

1137 search results - page 96 / 228
» The GLOBAL optimization method revisited
Sort
View
JMLR
2012
12 years 18 days ago
Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
Garvesh Raskutti, Martin J. Wainwright, Bin Yu
CDC
2008
IEEE
161views Control Systems» more  CDC 2008»
14 years 5 days ago
A fast algorithm to compute the controllability, decentralized fixed-mode, and minimum-phase radius of LTI systems
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
Simon Lam, Edward J. Davison
ALMOB
2006
155views more  ALMOB 2006»
13 years 10 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
14 years 1 months ago
Genetic algorithms for positioning and utilizing sensors in synthetically generated landscapes
Positioning multiple sensors for acquisition of a a given environment is one of the fundamental research areas in various fields, such as military scouting, computer vision and ro...
Haluk Topcuoglu, Murat Ermis
IMR
2004
Springer
14 years 3 months ago
A Generalized Graph-Theoretic Mesh Optimization Model
This paper presents a generic approach to mesh global optimization via node movement, based on a discrete graph-theoretic model. Mesh is considered as an electric system with lump...
Andrey A. Mezentsev