Sciweavers

360 search results - page 47 / 72
» The TV-Break Packing Problem
Sort
View
4OR
2006
99views more  4OR 2006»
14 years 9 months ago
A decomposition-based solution method for stochastic mixed integer nonlinear programs
This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...
Maria Elena Bruni
AIPS
2009
14 years 10 months ago
Semantic Attachments for Domain-Independent Planning Systems
Solving real-world problems using symbolic planning often requires a simplified formulation of the original problem, since certain subproblems cannot be represented at all or only...
Christian Dornhege, Patrick Eyerich, Thomas Keller...
69
Voted
EOR
2006
83views more  EOR 2006»
14 years 9 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
72
Voted
IEICET
2006
55views more  IEICET 2006»
14 years 9 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
AI
1998
Springer
14 years 9 months ago
GAS, A Concept on Modeling Species in Genetic Algorithms
This paper introduces a niching technique called GAS (S stands for species) which dynamically creates a subpopulation structure (taxonomic chart) using a radius function instead of...
Márk Jelasity, József Dombi