1650 search results - page 32 / 330 » The HOM problem is decidable |
ICALP
2010
Springer
14 years 14 days ago
2010
Springer
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of decidin...
PODC
1999
ACM
13 years 12 months ago
1999
ACM
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
JCSS
2010
13 years 6 months ago
2010
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
We consider constraint optimization problems where costs (or preferences) are all given, but some are tagged as possibly unstable, and provided with a range of alternative values. ...
TCS
2008
13 years 7 months ago
2008
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...