Sciweavers

1550 search results - page 109 / 310
» Optimizing search by showing results in context
Sort
View
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
14 years 26 days 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
ICDE
2010
IEEE
428views Database» more  ICDE 2010»
14 years 9 months ago
Supporting Top-K Keyword Search in XML Databases
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Liang Jeff Chen, Yannis Papakonstantinou
ATAL
2008
Springer
13 years 11 months ago
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Distributed constraint optimization problems (DCOPs) are a popular way of formulating and solving agent-coordination problems. It is often desirable to solve DCOPs optimally with m...
William Yeoh, Ariel Felner, Sven Koenig
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
13 years 10 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe
FODO
1998
Springer
242views Algorithms» more  FODO 1998»
14 years 1 months ago
Optimizing OID Indexing Cost in Temporal Object-Oriented Database Systems
In object-oriented database systems (OODB) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal ...
Kjetil Nørvåg, Kjell Bratbergsengen