Sciweavers

1026 search results - page 99 / 206
» An Optimal Solution to Room Search Problem
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
2010
Springer
174views Optimization» more  GECCO 2010»
15 years 9 months ago
Real-coded genetic algorithm benchmarked on noiseless black-box optimization testbed
Genetic algorithms—a class of stochastic population-based optimization techniques—have been widely realized as the effective tools to solve complicated optimization problems ...
Thanh-Do Tran, Gang-Gyoo Jin
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
15 years 10 months ago
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Shouichi Matsui, Ken-ichi Tokoro
CGO
2006
IEEE
16 years 12 days ago
Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...
Zhelong Pan, Rudolf Eigenmann
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...