Sciweavers

3874 search results - page 427 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
ISICA
2007
Springer
16 years 25 days ago
On the Performance of Metamodel Assisted MOEA/D
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
Wudong Liu, Qingfu Zhang, Edward P. K. Tsang, Cao ...
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
15 years 1 months ago
On optimal cooperative patrolling
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
CGF
2006
125views more  CGF 2006»
15 years 6 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
COCOON
2005
Springer
16 years 6 days ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum nu...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
15 years 8 months ago
Maximum Flows on Disjoint Paths
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
Guyslain Naves, Nicolas Sonnerat, Adrian Vetta