Sciweavers

2694 search results - page 273 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
16 years 5 days ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
SIGCOMM
2009
ACM
16 years 1 months ago
Optimizing the BSD routing system for parallel processing
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
Qing Li, Kip Macy
CVPR
2010
IEEE
16 years 3 months ago
Surface Extraction from Binary Volumes with Higher-Order Smoothness
A number of 3D shape reconstruction algorithms, in particular 3D image segmentation methods, produce their results in the form of binary volumes, where a binary value indicates whe...
Victor Lempitsky
TALG
2010
93views more  TALG 2010»
15 years 1 months ago
Distributed error confinement
We initiate the study of error confinement in distributed applications, where the goal is that only nodes that were directly hit by a fault may deviate from their correct external...
Yossi Azar, Shay Kutten, Boaz Patt-Shamir
EGC
2005
Springer
16 years 5 days ago
A Grid-Oriented Genetic Algorithm
Genetic algorithms (GAs) are stochastic search methods that have been successfully applied in many search, optimization, and machine learning problems. Their parallel counterpart (...
Jose Herrera, Eduardo Huedo, Rubén S. Monte...