Sciweavers

1940 search results - page 116 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
GECCO
2004
Springer
145views Optimization» more  GECCO 2004»
15 years 11 months ago
Automated Extraction of Problem Structure
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
Anthony Bucci, Jordan B. Pollack, Edwin D. de Jong
GECCO
2006
Springer
163views Optimization» more  GECCO 2006»
15 years 10 months ago
The quadratic multiple knapsack problem and three heuristic approaches to it
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
Amanda Hiley, Bryant A. Julstrom
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 11 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
FSTTCS
2006
Springer
15 years 10 months ago
Multi-stack Boundary Labeling Problems
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a recta...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
SAC
2009
ACM
16 years 1 months ago
On a discretizable subclass of instances of the molecular distance geometry problem
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
Carlile Lavor, Leo Liberti, Antonio Mucherino, Nel...