Sciweavers

928 search results - page 142 / 186
» The degree structure of Weihrauch-reducibility
Sort
View
76
Voted
STACS
2010
Springer
15 years 7 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...
114
Voted
ECBS
2009
IEEE
164views Hardware» more  ECBS 2009»
15 years 7 months ago
Semantically Enhanced Containers for Concurrent Real-Time Systems
Future space missions, such as Mars Science Laboratory, are built upon computing platforms providing a high degree of autonomy and diverse functionality. The increased sophisticat...
Damian Dechev, Peter Pirkelbauer, Nicolas Rouquett...
109
Voted
IROS
2009
IEEE
125views Robotics» more  IROS 2009»
15 years 7 months ago
A tale of two planners: Modular robotic planning with LDP
Abstract— LDP (Locally Distributed Predicates) is a distributed, high-level language for programming modular reconfigurable robot systems (MRRs). In this paper we present the im...
Michael DeRosa, Seth Copen Goldstein, Peter Lee, P...
115
Voted
AI
2009
Springer
15 years 7 months ago
Opinion Learning without Emotional Words
This paper shows that a detailed, although non-emotional, description of event or an action can be a reliable source for learning opinions. Empirical results show the practical uti...
Marina Sokolova, Guy Lapalme
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
15 years 7 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov