Sciweavers

1013 search results - page 60 / 203
» A Subexponential Algorithm for Abstract Optimization Problem...
Sort
View
CCE
2008
14 years 10 months ago
Multiobjective optimization of multipurpose batch plants using superequipment class concept
We present a novel approach for solving different design problems related to single products in multipurpose batch plants: the selection of one production line out of several avai...
Andrej Mosat, Laurent Cavin, Ulrich Fischer 0002, ...
JUCS
2006
112views more  JUCS 2006»
14 years 9 months ago
A Multi-objective Genetic Approach to Mapping Problem on Network-on-Chip
Abstract: Advances in technology now make it possible to integrate hundreds of cores (e.g. general or special purpose processors, embedded memories, application specific components...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi
GECCO
2003
Springer
120views Optimization» more  GECCO 2003»
15 years 3 months ago
New Usage of SOM for Genetic Algorithms
Abstract. Self-Organizing Map (SOM) is an unsupervised learning neural network and it is used for preserving the structural relationships in the data without prior knowledge. SOM h...
Jung Hwan Kim, Byung Ro Moon
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
14 years 10 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...