2233 search results - page 51 / 447 » On the Complexity of Theory Curbing |
108
click to vote
LATA
2010
Springer
15 years 11 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
111
click to vote
WG
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
88
Voted
JC
2006
15 years 1 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
RE
2006
Springer
15 years 1 months ago
2006
Springer
Cross-organizational information systems projects, such as ERP, imply an expensive requirements engineering (RE) cycle. Little is known yet about how to carry it out with more pre...
153
click to vote
STACS
1993
Springer
15 years 6 months ago
1993
Springer
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...