Sciweavers

3142 search results - page 173 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
FSTTCS
2009
Springer
15 years 10 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
110
Voted
WSC
2001
15 years 4 months ago
Using simulation and neural networks to develop a scheduling advisor
The research using artificial intelligence and computer simulation introduces a new approach for solving the job shop-scheduling problem. The new approach is based on the developm...
Thanos Alifantis, Stewart Robinson
159
Voted
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 3 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...
123
Voted
GECCO
2000
Springer
150views Optimization» more  GECCO 2000»
15 years 7 months ago
Automatic Synthesis of Electrical Circuits Containing a Free Variable Using Genetic Programming
A mathematical formula containing one or more free variables is "general" in the sense that it represents the solution to all instances of a problem (instead of just the...
John R. Koza, Martin A. Keane, Jessen Yu, William ...
158
Voted
EOR
2007
147views more  EOR 2007»
15 years 3 months ago
Routing and wavelength assignment in optical networks using bin packing based algorithms
This paper addresses the problem of routing and wavelength assignment (RWA) of static lightpath requests in wavelength routed optical networks. The objective is to minimize the nu...
Nina Skorin-Kapov