Sciweavers

2766 search results - page 302 / 554
» Algorithms for trigonometric polynomials
Sort
View
ASIAN
2003
Springer
113views Algorithms» more  ASIAN 2003»
15 years 12 months ago
Global Predicate Detection under Fine-Grained Modalities
Predicate detection is an important problem in distributed systems. Based on the temporal interactions of intervals, there exists a rich class of modalities under which global pred...
Punit Chandra, Ajay D. Kshemkalyani
CAV
2003
Springer
160views Hardware» more  CAV 2003»
15 years 12 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek
155
Voted
CPAIOR
2010
Springer
15 years 11 months ago
The Increasing Nvalue Constraint
This paper introduces the Increasing Nvalue constraint, which restricts the number of distinct values assigned to a sequence of variables so that each variable in the sequence is l...
Nicolas Beldiceanu, Fabien Hermenier, Xavier Lorca...
ESA
2001
Springer
61views Algorithms» more  ESA 2001»
15 years 11 months ago
A Separation Bound for Real Algebraic Expressions
Real algebraic expressions are expressions whose leaves are integers and whose internal nodes are additions, subtractions, multiplications, divisions, k-th root operations for int...
Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, S...
SPDP
1993
IEEE
15 years 10 months ago
Fast Rehashing in PRAM Emulations
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application ofte...
J. Keller