Sciweavers

805 search results - page 135 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
JCO
2011
115views more  JCO 2011»
14 years 4 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 4 months ago
Screening the parameters affecting heuristic performance
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
Enda Ridge, Daniel Kudenko
CDC
2009
IEEE
208views Control Systems» more  CDC 2009»
14 years 11 months ago
Sensor selection for hypothesis testing in wireless sensor networks: a Kullback-Leibler based approach
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
Dragana Bajovic, Bruno Sinopoli, João Xavie...
EOR
2008
106views more  EOR 2008»
14 years 10 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
15 years 4 months ago
SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks
Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereb...
Peter Boyen, Frank Neven, Dries Van Dyck, Aalt-Jan...