2944 search results - page 396 / 589 » Improving Bound Propagation |
156
click to vote
ICTCS
2005
Springer
16 years 2 days ago
2005
Springer
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in ...
177
click to vote
PPAM
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
171
click to vote
SAS
2005
Springer
16 years 1 days ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
165
click to vote
STACS
2005
Springer
16 years 1 days ago
2005
Springer
In property testing, we are given oracle access to a function f, and we wish to test if the function satisfies a given property P, or it is ε-far from having that property. In a...
225
click to vote
TAINN
2005
Springer
16 years 1 days ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...