3775 search results - page 493 / 755 » The Expression Problem Revisited |
162
click to vote
KBSE
1998
IEEE
15 years 11 months ago
1998
IEEE
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
202
click to vote
AFPAC
1997
Springer
15 years 11 months ago
1997
Springer
The topic of representation, recovery and manipulation of three-dimensional 3D scenes from two-dimensional 2D images thereof, provides a fertile ground for both intellectual th...
165
click to vote
APL
1993
ACM
15 years 10 months ago
1993
ACM
Although multicomputers are becoming feasible for solving large problems, they are difficult to program: Extraction of parallelism from scalar languages is possible, but limited....
171
Voted
STACS
1994
Springer
15 years 10 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
159
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in prac...