2661 search results - page 267 / 533 » Quantum Complexity Classes |
146
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
134
click to vote
SIGMETRICS
2005
ACM
15 years 9 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
135
click to vote
VMCAI
2004
Springer
15 years 9 months ago
2004
Springer
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
134
click to vote
ICSE
2003
IEEE-ACM
15 years 9 months ago
2003
IEEE-ACM
ct Feature Oriented Programming (FOP) is a design methodology and tools for program synthesis. The goal is to specify a target program in terms of the features that it offers, and ...
150
click to vote
ICNP
2000
IEEE
15 years 8 months ago
2000
IEEE
The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has recently spu...