1650 search results - page 38 / 330 » The HOM problem is decidable |
143
click to vote
FOSSACS
2012
Springer
13 years 11 months ago
2012
Springer
Synthesis from components is the automated construction of a composite system from a library of reusable components such that the system satisfies the given specification. This i...
131
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...
155
click to vote
DISOPT
2008
15 years 4 months ago
2008
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...
142
click to vote
DISOPT
2007
15 years 3 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
141
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...