Sciweavers

1404 search results - page 79 / 281
» Optimization problems in multiple-interval graphs
Sort
View
CDC
2009
IEEE
210views Control Systems» more  CDC 2009»
14 years 7 months ago
On maximum lifetime routing in Wireless Sensor Networks
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
Xu Ning, Christos G. Cassandras
GD
2004
Springer
15 years 3 months ago
Graph Drawing by Stress Majorization
Abstract. One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as ...
Emden R. Gansner, Yehuda Koren, Stephen C. North
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
15 years 1 months ago
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Shouichi Matsui, Ken-ichi Tokoro
SODA
1997
ACM
106views Algorithms» more  SODA 1997»
14 years 11 months ago
Optimal Bounds for Matching Routing on Trees
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
Louxin Zhang
ICPR
2004
IEEE
15 years 11 months ago
Reconstructing a Dynamic Surface from Video Sequences Using Graph Cuts in 4D Space-Time
This paper is concerned with the problem of dynamically reconstructing the 3D surface of an object undergoing non-rigid motion. The problem is cast as reconstructing a continuous ...
Narendra Ahuja, Ning Xu, Tianli Yu