7106 search results - page 50 / 1422 » Restricted Complexity, General Complexity |
101
click to vote
IEEEARES
2006
IEEE
15 years 4 months ago
2006
IEEE
Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A classic...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
CGF
2008
14 years 10 months ago
2008
The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real-time and offline applications decorrelate th...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...