1064 search results - page 30 / 213 » Disjoint Systems (Extended Abstract) |
ECEASST
2010
13 years 4 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
TACAS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
ENTCS
2008
13 years 7 months ago
2008
duce an abstract notion of POVM within the categorical quantum mechanical semantics in terms act categories. Our definition is justified by two facts: i. we provide a purely graph...