Sciweavers

1986 search results - page 291 / 398
» Path Separability of Graphs
Sort
View
DISOPT
2010
132views more  DISOPT 2010»
15 years 2 months ago
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
JSW
2008
203views more  JSW 2008»
15 years 2 months ago
Automatic Discovery of Semantic Relations Based on Association Rule
Automatic discovery of semantic relations between resources is a key issue in Web-based intelligent applications such as document understanding and Web services. This paper explore...
Xiangfeng Luo, Kai Yan, Xue Chen
TROB
2008
112views more  TROB 2008»
15 years 2 months ago
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
Mike Peasgood, Christopher M. Clark, John McPhee
VC
2008
94views more  VC 2008»
15 years 2 months ago
Virtual world explorations by using topological and semantic knowledge
This paper is dedicated to virtual world exploration techniques. Automatic camera control is important in many fields as computational geometry, visual servoing, robot motion, grap...
Dmitry Sokolov, Dimitri Plemenos
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
15 years 2 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...