Sciweavers

95 search results - page 17 / 19
» Heuristic solutions for general concave minimum cost network...
Sort
View
FOCS
2008
IEEE
14 years 1 months ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
13 years 8 months ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder
GSN
2009
Springer
13 years 11 months ago
Efficient Viewpoint Selection for Urban Texture Documentation
We envision participatory texture documentation (PTD) as a process in which a group of participants (dedicated individuals and/or general public) with camera-equipped mobile phones...
Houtan Shirani-Mehr, Farnoush Banaei Kashani, Cyru...
4OR
2010
148views more  4OR 2010»
13 years 5 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen