Sciweavers

336 search results - page 43 / 68
» Consultant-guided search algorithms for the quadratic assign...
Sort
View
IEEEVAST
2010
13 years 2 months ago
Interactive visual analysis of multiobjective optimizations
Optimization problems are typically addressed by purely automatic approaches. For multi-objective problems, however, a single best solution often does not exist. In this case, it ...
Wolfgang Berger, Harald Piringer
INFOCOM
2002
IEEE
14 years 15 days ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
ML
2010
ACM
119views Machine Learning» more  ML 2010»
13 years 6 months ago
A cooperative coevolutionary algorithm for instance selection for instance-based learning
This paper presents a cooperative evolutionary approach for the problem of instance selection for instance based learning. The presented model takes advantage of one of the most r...
Nicolás García-Pedrajas, Juan Antoni...
CEC
2007
IEEE
13 years 9 months ago
Hybrid optimization using DIRECT, GA, and SQP for global exploration
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
Satoru Hiwa, Tomoyuki Hiroyasu, Mitsunori Miki
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 7 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...