Sciweavers

526 search results - page 69 / 106
» Generalized benchmark generation for dynamic combinatorial p...
Sort
View
CGF
2002
135views more  CGF 2002»
14 years 9 months ago
Slow Growing Subdivision (SGS) in Any Dimension: Towards Removing the Curse of Dimensionality
In recent years subdivision methods have been one of the most successful techniques applied to the multi-resolution representation and visualization of surface meshes. Extension t...
Valerio Pascucci
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
15 years 3 months ago
Advanced models of cellular genetic algorithms evaluated on SAT
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...
Enrique Alba, Hugo Alfonso, Bernabé Dorrons...
IPPS
2006
IEEE
15 years 3 months ago
Skewed allocation of non-uniform data for broadcasting over multiple channels
The problem of data broadcasting over multiple channels consists in partitioning data among channels, depending on data popularities, and then cyclically transmitting them over ea...
Alan A. Bertossi, Maria Cristina Pinotti
NIPS
2001
14 years 11 months ago
The Concave-Convex Procedure (CCCP)
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
Alan L. Yuille, Anand Rangarajan
AAI
2006
126views more  AAI 2006»
14 years 10 months ago
Theory and practice of field-based motion coordination in multiagent systems
Enabling and managing coordination activities between autonomous, possibly mobile, computing entities in dynamic computing scenarios challenges traditional approaches to distribut...
Marco Mamei, Franco Zambonelli