Sciweavers

432 search results - page 40 / 87
» Minimum Weight Pseudo-Triangulations
Sort
View
DAGSTUHL
2006
15 years 11 hour ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
DISOPT
2008
113views more  DISOPT 2008»
14 years 10 months ago
The inverse 1-median problem on a cycle
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
Rainer E. Burkard, Carmen Pleschiutschnig, Jianzho...
ICIP
2003
IEEE
16 years 6 days ago
Robust line detection using a weighted MSE estimator
In this paper we introduce a novel line detection algorithm based on a weighted minimum mean square error (MSE) formulation. This algorithm has been developed to enable an autonom...
Guido M. Schuster, Aggelos K. Katsaggelos
ANOR
2005
160views more  ANOR 2005»
14 years 10 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
ICC
2007
IEEE
106views Communications» more  ICC 2007»
15 years 5 months ago
A Hierarchical Weighted Round Robin EPON DBA Scheme and Its Comparison with Cyclic Water-Filling Algorithm
—A H-WRR (Hierarchical Weighted Round-Robin) EPON (Ethernet Passive Optical Network) DBA (Dynamic Bandwidth Allocation) algorithm is devised and investigated. WRR table entries h...
Chan Kim, Tae-Whan Yoo, Bong-Tae Kim