Sciweavers

10988 search results - page 512 / 2198
» Algorithmic Folding Complexity
Sort
View
ATAL
2004
Springer
16 years 13 days ago
Towards a Formal Approach to Overhearing: Algorithms for Conversation Identification
Overhearing is gaining attention as a generic method for cooperative monitoring of distributed, open, multiagent systems. It involves monitoring the routine conversations of agent...
Gery Gutnik, Gal A. Kaminka
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
16 years 8 days ago
Study Diploid System by a Hamiltonian Cycle Problem Algorithm
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
Dong Xianghui, Ruwei Dai
VVS
2000
IEEE
130views Visualization» more  VVS 2000»
15 years 11 months ago
A practical evaluation of popular volume rendering algorithms
This paper evaluates and compares four volume rendering algorithms that have become rather popular for rendering datasets described on uniform rectilinear grids: raycasting, splat...
Michael Meißner, Jian Huang, Dirk Bartz, Kla...
IPPS
1997
IEEE
15 years 11 months ago
A Parallel Algorithm for Weighted Distance Transforms
This paper presents a parallel algorithm for the weighted distance transform and the nearest feature transform of an n 2 n binary image. We show that the algorithm runs in O(log n...
Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuza...
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
15 years 10 months ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang