Sciweavers

1547 search results - page 122 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
GECCO
2005
Springer
101views Optimization» more  GECCO 2005»
15 years 12 months ago
A scalable parallel genetic algorithm for x-ray spectroscopic analysis
We use a parallel multi-objective genetic algorithm to drive a search and reconstruction spectroscopic analysis of plasma gradients in inertial confinement fusion (ICF) implosion...
Kai Xu, Sushil J. Louis, Roberto C. Mancini
INFOCOM
2000
IEEE
15 years 10 months ago
Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
Tibor Cinkler, Dániel Marx, Claus Popp Lars...
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
15 years 4 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras
CEC
2008
IEEE
16 years 24 days ago
NichingEDA: Utilizing the diversity inside a population of EDAs for continuous optimization
— Since the Estimation of Distribution Algorithms (EDAs) have been introduced, several single model based EDAs and mixture model based EDAs have been developed. Take Gaussian mod...
Weishan Dong, Xin Yao