Sciweavers

424 search results - page 39 / 85
» Majority Logic
Sort
View
WSC
1998
15 years 1 months ago
Efficient Process Interaction with Threads in Parallel Discrete Event Simulation
Parallel discrete event simulation (PDES) decreases a simulation's runtime by splitting the simulation's work between multiple processors. Many users avoid PDES because ...
Reuben Passqini, Vernon Rego
AI
2005
Springer
14 years 11 months ago
First order LUB approximations: characterization and algorithms
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
Alvaro del Val
TACAS
2009
Springer
109views Algorithms» more  TACAS 2009»
15 years 6 months ago
TaPAS: The Talence Presburger Arithmetic Suite
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
Jérôme Leroux, Gérald Point
HRI
2010
ACM
15 years 5 months ago
Mysterious machines
—Alan Turing proposed a test for the intelligence of machines in 1950 [1]. Despite great efforts, no computer has passed this test so far. Each year, chat bots compete for the Lo...
Billy Schonenberg, Christoph Bartneck
CGO
2008
IEEE
15 years 6 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...