787 search results - page 109 / 158 » Polynomial Constants are Decidable |
TACAS
2005
Springer
14 years 3 months ago
2005
Springer
The interaction among concurrently executing threads of a program results in insidious programming errors that are difficult to reproduce and fix. Unfortunately, the problem of ve...
WAOA
2005
Springer
14 years 3 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
CSCW
2004
ACM
14 years 3 months ago
2004
ACM
The growing use of Instant Messaging for social and work-related communication has created a situation where incoming messages often become a distraction to users while they are p...
IWPEC
2004
Springer
14 years 3 months ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
ECOOP
1997
Springer
14 years 1 months ago
1997
Springer
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...