3819 search results - page 138 / 764 » Simple Easy Terms |
185
click to vote
CADE
2002
Springer
16 years 7 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
296
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
170
click to vote
ICSE
2004
IEEE-ACM
16 years 7 months ago
2004
IEEE-ACM
Abstract. Building systems from existing applications written in two or more languages is common practice. Such systems are polylingual. Polylingual systems are relatively easy to ...
172
click to vote
ICFP
2001
ACM
16 years 6 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
196
click to vote
PPOPP
2010
ACM
16 years 4 months ago
2010
ACM
Exploiting the emerging reality of affordable multi-core architeces through providing programmers with simple abstractions that would enable them to easily turn their sequential p...