Sciweavers

14165 search results - page 68 / 2833
» The generalized two-server problem
Sort
View
156
Voted
ICRA
1993
IEEE
184views Robotics» more  ICRA 1993»
15 years 7 months ago
Vision-Guided Exploration: A Step Toward General Motion Planning in Three Dimensions
We present an approach for solving the path planning problem for a mobile robot operating in an unknown, three dimensional environment containing obstacles of arbitrary shape. The...
Kiriakos N. Kutulakos, Vladimir J. Lumelsky, Charl...
101
Voted
UC
2005
Springer
15 years 9 months ago
On Formulations of Firing Squad Synchronization Problems
Abstract. We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general state and the general state to be used i...
Kojiro Kobayashi, Darin Goldstein
143
Voted
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 3 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
114
Voted
COCOON
2007
Springer
15 years 9 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
163
Voted
ICTAI
2009
IEEE
15 years 1 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux