546 search results - page 71 / 110 » Extended Null-Move Reductions |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
CONCUR
2008
Springer
14 years 11 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
AAAI
1998
14 years 11 months ago
1998
Hierarchical task network and action-based planning approaches have traditionally been studied separately. In many domains, human expertise in the form of hierarchical reduction s...
ENTCS
2006
14 years 9 months ago
2006
We deal with temporal aspects of distributed systems, introducing and studying a new model called timed distributed -calculus. This model extends distributed -calculus with timers...
FOCI
2007
IEEE
15 years 1 months ago
2007
IEEE
Abstract-- The dual notions of discernibility and indiscernibility play an important role in intelligent data analysis. While discernibility focuses on the differences, the indisce...