Sciweavers

242 search results - page 30 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
SPAA
2004
ACM
15 years 5 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
CCGRID
2009
IEEE
15 years 6 months ago
Reliability-Oriented Genetic Algorithm for Workflow Applications Using Max-Min Strategy
— To optimize makespan and reliability for workflow applications, most existing works use list heuristics rather than genetic algorithms (GAs) which can usually give better solut...
Xiaofeng Wang, Rajkumar Buyya, Jinshu Su
IJON
2010
189views more  IJON 2010»
14 years 10 months ago
Inference and parameter estimation on hierarchical belief networks for image segmentation
We introduce a new causal hierarchical belief network for image segmentation. Contrary to classical tree structured (or pyramidal) models, the factor graph of the network contains...
Christian Wolf, Gérald Gavin
NOCS
2007
IEEE
15 years 6 months ago
A Hybrid Analog-Digital Routing Network for NoC Dynamic Routing
Dynamic routing can substantially enhance the quality of service for multiprocessor communication, and can provide intelligent adaptation of faulty links during run time. Implemen...
Terrence S. T. Mak, N. Pete Sedcole, Peter Y. K. C...
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
15 years 24 days ago
Fitnessless coevolution
We introduce fitnessless coevolution (FC), a novel method of comparative one-population coevolution. FC plays games between individuals to settle tournaments in the selection pha...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...