Sciweavers

193 search results - page 4 / 39
» Several ways to solve the MSO problem
Sort
View
EUROGP
2010
Springer
182views Optimization» more  EUROGP 2010»
13 years 7 months ago
Unsupervised Problem Decomposition Using Genetic Programming
We propose a new framework based on Genetic Programming (GP) to automatically decompose problems into smaller and simpler tasks. The framework uses GP at two levels. At the top lev...
Ahmed Kattan, Alexandros Agapitos, Riccardo Poli
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 6 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
AIPS
2007
13 years 8 months ago
The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...
Anders Dohn, Esben Kolind, Jens Clausen
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
13 years 9 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
PROCEDIA
2010
85views more  PROCEDIA 2010»
13 years 4 months ago
Toward interactive statistical modeling
When solving machine learning problems, there is currently little automated support for easily experimenting with alternative statistical models or solution strategies. This is be...
Sooraj Bhat, Ashish Agarwal, Alexander Gray, Richa...