Sciweavers

400 search results - page 24 / 80
» Hard Problem Generation for MKP
Sort
View
EVOW
2009
Springer
15 years 8 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
AIPS
2006
15 years 5 months ago
Planning for PDDL3 - An OCSP Based Approach
Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan traj...
Bharat Ranjan Kavuluri, Naresh Babu Saladi, Deepak...
MOBIQUITOUS
2005
IEEE
15 years 9 months ago
Temporal Transcoding for Mobile Video Communication
Third generation mobile communication systems will provide more advanced types of interactive and distribution services, and video is one of the most prominent applications for mu...
Maurizio A. Bonuccelli, Francesca Lonetti, Frances...
129
Voted
GECCO
2003
Springer
15 years 9 months ago
Chromosome Reuse in Genetic Algorithms
This paper introduces a novel genetic algorithm strategy based on the reuse of chromosomes from previous generations in the creation of offspring individuals. A number of chromoso...
Adnan Acan, Yüce Tekol
119
Voted
JCSS
2007
88views more  JCSS 2007»
15 years 3 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...
Denis Xavier Charles