Sciweavers

113 search results - page 6 / 23
» Improved Approximation for the Directed Spanner Problem
Sort
View
74
Voted
GECCO
2003
Springer
15 years 4 months ago
Effective Use of Directional Information in Multi-objective Evolutionary Computation
While genetically inspired approaches to multi-objective optimization have many advantages over conventional approaches, they do not explicitly exploit directional/gradient informa...
Martin Brown, Robert E. Smith
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
13 years 2 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
DCOSS
2008
Springer
15 years 1 months ago
Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
Ryo Sugihara, Rajesh K. Gupta
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
14 years 11 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
ICARCV
2006
IEEE
126views Robotics» more  ICARCV 2006»
15 years 5 months ago
Improvement to the Minimization of Hybrid Error Functions for Pose Alignment
— Many problems in computer vision such as pose recovery and structure estimation are formulated as a minimization process. These problems vary in the use of image measurements d...
A. H. Abdul Hafez, C. V. Jawahar