Sciweavers

TOMACS
2008
91views more  TOMACS 2008»
13 years 10 months ago
On constructing optimistic simulation algorithms for the discrete event system specification
abstractly; it is intended to provide a basis for implementing efficient and scalable parallel algorithms that correctly simulate DEVS models. Categories and Subject Descriptors: I...
James J. Nutaro
TAP
2008
Springer
101views Hardware» more  TAP 2008»
13 years 10 months ago
A gaze-based study for investigating the perception of visual realism in simulated scenes
on the perception of visual realism. This study suggests that post-recall or simple abstraction of visual experience is not accurate and the use of eye tracking provides an effecti...
Mohamed A. ElHelw, Marios Nicolaou, Adrian James C...
ICSR
2000
Springer
14 years 2 months ago
Achieving Extensibility Through Product-Lines and Domain-Specific Languages: A Case Study
ions that are fundamental to simulators. We present preliminary results that show how our PLA and DSL synergistically produce a more flexible way of implementing state-machine-base...
Don S. Batory, Clay Johnson, Bob MacDonald, Dale v...
POPL
1998
ACM
14 years 3 months ago
Local Type Inference
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...
Benjamin C. Pierce, David N. Turner
ESOP
2005
Springer
14 years 4 months ago
Analysis of Modular Arithmetic
Additional Key Words and Phrases: program analysis, modular arithmetic, abstract interpretation, affine relation, interprocedural analysis
Markus Müller-Olm, Helmut Seidl
LICS
2006
IEEE
14 years 4 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
14 years 11 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle