4397 search results - page 351 / 880 » Relational Algebra Operations |
160
Voted
TCS
2008
15 years 5 months ago
2008
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
124
click to vote
ENTCS
2000
15 years 4 months ago
2000
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
135
click to vote
SQJ
2002
15 years 4 months ago
2002
Acknowledging the intense requirement for low power operation in most portable computing systems, this paper introduces the notion of energy efficient software design and proposes ...
141
Voted
LICS
2010
IEEE
15 years 3 months ago
2010
IEEE
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
123
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper is the first extensive performance study of a recently proposed parallel programming model, called Concurrent Collections (CnC). In CnC, the programmer expresses her co...