2233 search results - page 91 / 447 » On the Complexity of Theory Curbing |
139
click to vote
LICS
2009
IEEE
16 years 28 days ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
153
click to vote
ATAL
2009
Springer
16 years 27 days ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
150
click to vote
COCO
2009
Springer
16 years 27 days 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...
182
click to vote
MODELS
2007
Springer
16 years 13 days ago
2007
Springer
To promote the Model-Based software engineering development of user interfaces, this paper proposes a model driven development approach of complex user interface. The approach cap...
167
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...