Sciweavers

591 search results - page 50 / 119
» Extremal Optimization: Methods derived from Co-Evolution
Sort
View
PE
2007
Springer
131views Optimization» more  PE 2007»
13 years 8 months ago
Moment estimation in delay tomography with spatial dependence
Parametric models for estimating network link delays with incomplete data that incorporate spatial correlation are formulated. Fast numerical methods for estimation of parameters ...
Ian H. Dinwoodie, Eric A. Vance
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
13 years 7 days ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache
BMCBI
2004
127views more  BMCBI 2004»
13 years 8 months ago
Optimized LOWESS normalization parameter selection for DNA microarray data
Background: Microarray data normalization is an important step for obtaining data that are reliable and usable for subsequent analysis. One of the most commonly utilized normaliza...
John A. Berger, Sampsa Hautaniemi, Anna-Kaarina J&...
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
13 years 8 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
COLT
2006
Springer
14 years 14 days ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal