Sciweavers

8780 search results - page 119 / 1756
» On the Feasibility of Consistent Computations
Sort
View
LICS
2008
IEEE
15 years 4 months ago
On the Computational Complexity of Cut-Reduction
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
Klaus Aehlig, Arnold Beckmann
ICRA
2005
IEEE
175views Robotics» more  ICRA 2005»
15 years 3 months ago
Trajectory Planning and Tracking Control of Underactuated AUVs
− This paper addresses the combined problem of trajectory planning and tracking control for underactuated AUVs moving on the horizontal plane. A reference feasible trajectory for...
Filoktimon Repoulias, Evangelos Papadopoulos
ENDM
2010
127views more  ENDM 2010»
14 years 10 months ago
MPQ-trees for orthogonal packing problem
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
Cédric Joncour, Arnaud Pêcher, Petru ...
ALGORITHMICA
2010
115views more  ALGORITHMICA 2010»
14 years 9 months ago
Multi-Color Pebble Motion on Graphs
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
Gilad Goraly, Refael Hassin
PODC
2005
ACM
15 years 3 months ago
Primal-dual based distributed algorithms for vertex cover with semi-hard capacities
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
Fabrizio Grandoni, Jochen Könemann, Alessandr...