Sciweavers

7228 search results - page 376 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ATAL
2005
Springer
15 years 11 months ago
Tunably decentralized algorithms for cooperative target observation
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
Sean Luke, Keith Sullivan, Liviu Panait, Gabriel C...
148
Voted
COMPGEOM
2010
ACM
15 years 11 months ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...
BCB
2010
138views Bioinformatics» more  BCB 2010»
15 years 1 months ago
Comparative analysis of biclustering algorithms
Biclustering is a very popular method to identify hidden co-regulation patterns among genes. There are numerous biclustering algorithms designed to undertake this challenging task...
Doruk Bozdag, Ashwin S. Kumar, Ümit V. &Ccedi...
SAC
2004
ACM
15 years 11 months ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
Harald Feltl, Günther R. Raidl
135
Voted
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
15 years 9 months ago
Spectral techniques for graph bisection in genetic algorithms
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
Jacob G. Martin