1968 search results - page 249 / 394 » The Complexity of Valued Constraint Models |
119
click to vote
CRYPTO
2001
Springer
15 years 6 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
125
click to vote
IFIP3
1998
15 years 3 months ago
1998
Development of a wide spread project intended to teaching Computer Science, integrating a considerable number of students all over a country with big geographical extension and sc...
128
Voted
GRAPHITE
2003
ACM
15 years 6 months ago
2003
ACM
We consider a repository of animation models and motions that can be reused to generate new animation sequences. For instance, a user can retrieve an animation of a dog kicking it...
122
Voted
DSN
2002
IEEE
15 years 6 months ago
2002
IEEE
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...
103
Voted
MICRO
2008
IEEE
15 years 1 months ago
2008
IEEE
Verification of chip multiprocessor memory systems remains challenging. While formal methods have been used to validate protocols, simulation is still the dominant method used to ...