Sciweavers

1404 search results - page 42 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ICS
1993
Tsinghua U.
15 years 1 months ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
GECCO
2006
Springer
147views Optimization» more  GECCO 2006»
15 years 1 months ago
Generalized cycle crossover for graph partitioning
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems ob...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byun...
AI
2011
Springer
14 years 4 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
83
Voted
NETWORK
2010
122views more  NETWORK 2010»
14 years 4 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
ICCV
2007
IEEE
15 years 11 months ago
Introducing Curvature into Globally Optimal Image Segmentation: Minimum Ratio Cycles on Product Graphs
While the majority of competitive image segmentation methods are based on energy minimization, only few allow to efficiently determine globally optimal solutions. A graphtheoretic...
Thomas Schoenemann, Daniel Cremers