Sciweavers

4894 search results - page 762 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
TON
2008
125views more  TON 2008»
13 years 8 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
TPDS
2008
126views more  TPDS 2008»
13 years 8 months ago
Efficient Directional Network Backbone Construction in Mobile Ad Hoc Networks
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
Shuhui Yang, Jie Wu, Fei Dai
EC
2002
180views ECommerce» more  EC 2002»
13 years 8 months ago
Combining Convergence and Diversity in Evolutionary Multiobjective Optimization
Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to nd a number of ...
Marco Laumanns, Lothar Thiele, Kalyanmoy Deb, Ecka...
JIRS
2000
105views more  JIRS 2000»
13 years 8 months ago
The Formula One Tire Changing Robot (F1-T.C.R.)
: Formula One racing is one of the most fascinating sports ever, it is a perfect combination of high speed, technology, pressure and danger. One problem associated with car racing ...
Raul Mihali, Tarek M. Sobh
JUCS
2002
131views more  JUCS 2002»
13 years 7 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici