Sciweavers

1920 search results - page 58 / 384
» The Complexity of the A B C Problem
Sort
View
PODC
2009
ACM
16 years 6 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
ECBS
1996
IEEE
93views Hardware» more  ECBS 1996»
15 years 10 months ago
A Methodology for Designing and Dimensioning Critical Complex Computing Systems
It is widely recognized that real-time,fault-tolerant and distributed computing technologies play a key role in the deployment of many current andfuture (civilian or Defense) crit...
Gérard Le Lann
CCA
2009
Springer
16 years 17 days ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
CAGD
2006
114views more  CAGD 2006»
15 years 6 months ago
Jet subdivision schemes on the k-regular complex
We introduce a new family of subdivision schemes called jet subdivision schemes. Jet subdivision schemes are a natural generalization of the commonly used subdivision schemes for ...
Yonggang Xue, Thomas P.-Y. Yu, Tom Duchamp
ICRA
2009
IEEE
112views Robotics» more  ICRA 2009»
16 years 20 days ago
Combining planning and motion planning
Abstract— Robotic manipulation is important for real, physical world applications. General Purpose manipulation with a robot (eg. delivering dishes, opening doors with a key, etc...
Jaesik Choi, Eyal Amir