787 search results - page 67 / 158 » Polynomial Constants are Decidable |
ICDT
2012
ACM
11 years 10 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
PODC
1999
ACM
14 years 13 days ago
1999
ACM
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...