Sciweavers

13987 search results - page 390 / 2798
» The Two Guards Problem
Sort
View
ICCCN
2007
IEEE
16 years 1 months ago
Enhancing Robustness Under Dual-Link Failures
—In this paper, we show that minimizing the product of path lengths results in minimizing the probability of connection failure between a source and destination given two links h...
Sandeep Kour Ahuja, Srinivasan Ramasubramanian
IPPS
2007
IEEE
16 years 1 months ago
Implementing Replica Placements: Feasibility and Cost Minimization
Given two replication schemes old X and new X , the Replica Transfer Scheduling Problem (RTSP) aims at reaching new X , starting from old X , with minimal implementation cost. In ...
Thanasis Loukopoulos, Nikos Tziritas, Petros Lamps...
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
16 years 1 months ago
Global multiobjective optimization via estimation of distribution algorithm with biased initialization and crossover
Multiobjective optimization problems with many local Pareto fronts is a big challenge to evolutionary algorithms. In this paper, two operators, biased initialization and biased cr...
Aimin Zhou, Qingfu Zhang, Yaochu Jin, Bernhard Sen...
MFCS
2007
Springer
16 years 1 months ago
Exact Algorithms for L (2, 1)-Labeling of Graphs
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
Jan Kratochvíl, Dieter Kratsch, Mathieu Lie...
SAC
2006
ACM
16 years 24 days ago
Spatial geometric constraint solving based on k-connected graph decomposition
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...
Gui-Fang Zhang, Xiao-Shan Gao