Sciweavers

TNN
2008
106views more  TNN 2008»
13 years 4 months ago
Unsupervised Segmentation With Dynamical Units
In this paper, we present a novel network to separate mixtures of inputs that have been previously learned. A significant capability of the network is that it segments the componen...
A. Ravishankar Rao, Guillermo A. Cecchi, Charles C...
GPEM
2007
113views more  GPEM 2007»
13 years 5 months ago
An evolutionary approach to cancer chemotherapy scheduling
In this paper, we investigate the employment of evolutionary algorithms as a search mechanism in a decision support system for designing chemotherapy schedules. Chemotherapy invol...
Gabriela Ochoa, Minaya Villasana, Edmund K. Burke
PAMI
2008
221views more  PAMI 2008»
13 years 5 months ago
Plane-Based Optimization for 3D Object Reconstruction from Single Line Drawings
In previous optimization-based methods of 3D planar-faced object reconstruction from single 2D line drawings, the missing depths of the vertices of a line drawing (and other parame...
Jianzhuang Liu, Liangliang Cao, Zhenguo Li, Xiaoou...
MP
2006
106views more  MP 2006»
13 years 5 months ago
Worst-case distribution analysis of stochastic programs
We show that for even quasi-concave objective functions the worst-case distribution, with respect to a family of unimodal distributions, of a stochastic programming problem is a u...
Alexander Shapiro
EOR
2007
101views more  EOR 2007»
13 years 5 months ago
Optimizing an objective function under a bivariate probability model
The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probabi...
Xavier Brusset, Nico M. Temme
CPHYSICS
2006
127views more  CPHYSICS 2006»
13 years 5 months ago
GenAnneal: Genetically modified Simulated Annealing
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
Ioannis G. Tsoulos, Isaac E. Lagaris
COR
2006
86views more  COR 2006»
13 years 5 months ago
Parametric tabu-search for mixed integer programs
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying br...
Fred Glover
CONSTRAINTS
2008
138views more  CONSTRAINTS 2008»
13 years 5 months ago
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Martin C. Cooper
COR
2010
150views more  COR 2010»
13 years 5 months ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...
BMCBI
2008
152views more  BMCBI 2008»
13 years 5 months ago
Predicting biological system objectives de novo from internal state measurements
Background: Optimization theory has been applied to complex biological systems to interrogate network properties and develop and refine metabolic engineering strategies. For examp...
Erwin P. Gianchandani, Matthew A. Oberhardt, Antho...