Sciweavers

1159 search results - page 224 / 232
» Adding Concurrency to a Programming Language
Sort
View
CP
2005
Springer
14 years 1 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus
HICSS
2003
IEEE
154views Biometrics» more  HICSS 2003»
14 years 26 days ago
Project JXTA-C: Enabling a Web of Things
The Web, the collection of all devices connected to the Internet, is on the verge of experiencing a massive evolution from a Web of Computers to a Web of Things as new devices suc...
Bernard Traversat, Mohamed Abdelaziz, Dave Doolin,...
CP
2003
Springer
14 years 24 days ago
Comparison of Symmetry Breaking Methods
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Karen E. Petrie
CSL
2003
Springer
14 years 24 days ago
Modular Semantics and Logics of Classes
The semantics of class-based languages can be defined in terms of objects only [8, 7, 1] if classes are viewed as objects with a constructor method. One obtains a store in which m...
Bernhard Reus
DATE
2000
IEEE
94views Hardware» more  DATE 2000»
13 years 12 months ago
Shared Memory Implementations of Synchronous Dataflow Specifications
There has been a proliferation of block-diagram environments for specifying and prototyping DSP systems. These include tools from academia like Ptolemy [3], and GRAPE [7], and com...
Praveen K. Murthy, Shuvra S. Bhattacharyya