4934 search results - page 81 / 987 » complexity 2008 |
124
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
120
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...
138
click to vote
CADE
2008
Springer
15 years 5 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
124
Voted
ARC
2008
Springer
15 years 4 months ago
2008
Springer
: This paper discusses the interplay between networks and control systems. As we gain more understanding about the structure and dynamics of physical networks, their effects on the...
150
click to vote
IS
2008
15 years 3 months ago
2008
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...