1199 search results - page 55 / 240 » Parameterized Proof Complexity |
COCO
2009
Springer
14 years 3 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
CAV
2009
Springer
14 years 9 months ago
2009
Springer
D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction. For deadlock detecti...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
ANSS
2007
IEEE
14 years 3 months ago
2007
IEEE
This work describes a Java based development platform which is intended to support ad hoc network researchers in application and protocol design. Software development within this ...
JUCS
2010
13 years 7 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...