2412 search results - page 238 / 483 » Which Problems Have Strongly Exponential Complexity |
125
click to vote
CP
1998
Springer
15 years 8 months ago
1998
Springer
We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are tur...
132
Voted
COLING
1992
15 years 5 months ago
1992
Q Should I take AI this semester? We address the problem of generating a coherent A If you want to take courses likeparagraph presenting arguments for a conclusion in a Natural La...
128
click to vote
CIC
2004
15 years 5 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
151
click to vote
IANDC
2008
15 years 3 months ago
2008
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
139
click to vote
PPOPP
2012
ACM
13 years 11 months ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...