Sciweavers

2555 search results - page 290 / 511
» Quantifiers and Working Memory
Sort
View
APN
2004
Springer
15 years 10 months ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo
IMR
2004
Springer
15 years 10 months ago
Extracting Hexahedral Mesh Structures from Balanced Linear Octrees
Generating large 3D unstructured meshes with over 1 billion elements has been a challenging task. Fortunately, for a large class of applications with relatively simple geometries,...
Tiankai Tu, David R. O'Hallaron
ITS
2004
Springer
84views Multimedia» more  ITS 2004»
15 years 10 months ago
Web-Based Intelligent Multimedia Tutoring for High Stakes Achievement Tests
Abstract. We describe Wayang Outpost, a web-based ITS for the Math section of the Scholastic Aptitude Test (SAT). It has several distinctive features: help with multimedia animatio...
Ivon Arroyo, Carole R. Beal, Tom Murray, Rena Wall...
141
Voted
SPIN
2004
Springer
15 years 10 months ago
Minimization of Counterexamples in SPIN
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
Paul Gastin, Pierre Moro, Marc Zeitoun
ARITH
2003
IEEE
15 years 10 months ago
The Case for a Redundant Format in Floating Point Arithmetic
This work uses a partially redundant number system as an internal format for floating point arithmetic operations. The redundant number system enables carry free arithmetic opera...
Hossam A. H. Fahmy, Michael J. Flynn