Sciweavers

1090 search results - page 112 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
CVPR
2006
IEEE
14 years 3 months ago
Active Graph Cuts
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
Olivier Juan, Yuri Boykov
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
13 years 10 months ago
Using quotient graphs to model neutrality in evolutionary search
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
Dominic Wilson, Devinder Kaur
CORR
2004
Springer
144views Education» more  CORR 2004»
13 years 9 months ago
Iterative Quantization Using Codes On Graphs
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...
Emin Martinian, Jonathan S. Yedidia
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
13 years 10 months ago
The study for transportation planning considered the inventory using hybrid genetic algorithm
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
Shinichiro Ataka, Mitsuo Gen
TPDS
1998
110views more  TPDS 1998»
13 years 8 months ago
On Exploiting Task Duplication in Parallel Program Scheduling
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
Ishfaq Ahmad, Yu-Kwong Kwok