3575 search results - page 4 / 715 » Presentations of computably enumerable reals |
PRESENCE
2010
14 years 4 months ago
2010
Simulated humans in computer interfaces are increasingly taking on roles that were once reserved for real humans. The presentation of simulated humans is affected by their appeara...
TCS
2002
14 years 9 months ago
2002
A real is computably enumerable if it is the limit of a computable, increasing, converging sequence of rationals. A real is random if its binary expansion is a random sequence. Ou...
DAC
1996
ACM
15 years 1 months ago
1996
ACM
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
DAC
1995
ACM
15 years 1 months ago
1995
ACM
—Embedded computer systems are characterized by the presence of a processor running application-specific dedicated software. A large number of these systems must satisfy real-ti...
COMBINATORICS
1999
14 years 9 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...