Sciweavers

2911 search results - page 523 / 583
» A Logic of Graph Constraints
Sort
View
81
Voted
WEBDB
2010
Springer
152views Database» more  WEBDB 2010»
15 years 5 months ago
Reconciling two models of multihierarchical markup
For documents with complex or atypical annotations, multihierarchical structures play the role of the document tree in traditional XML documents. We define a model of overlapping...
Neil Moore
FOCS
2002
IEEE
15 years 5 months ago
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
Julia Chuzhoy, Joseph Naor
103
Voted
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
15 years 5 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
87
Voted
PARELEC
2002
IEEE
15 years 5 months ago
Techniques for Optimization of Net Algorithms
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
Anatoly Prihozhy, Daniel Mlynek, Michail Solomenni...
93
Voted
FM
2009
Springer
95views Formal Methods» more  FM 2009»
15 years 5 months ago
On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni