3229 search results - page 162 / 646 » The Theory of Timed Automata |
190
click to vote
DIAGRAMS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
199
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
213
click to vote
WSC
1998
15 years 7 months ago
1998
A significant challenge in implementing the Theory of Constraints in the semiconductor industry is the complex and reentrant nature of the manufacturing process. Managing a constr...
197
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
213
click to vote
TSP
2010
15 years 1 months ago
2010
A cross-layer scheme, namely ALOHA With Collision Resolution (ALOHA-CR), is proposed for high throughput wireless communications in a cellular scenario. Transmission occurs in a t...