Sciweavers

968 search results - page 39 / 194
» A faster implementation of APlace
Sort
View
APN
2000
Springer
15 years 7 months ago
Efficient Symbolic State-Space Construction for Asynchronous Systems
Many techniques for the verification of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the sta...
Gianfranco Ciardo, Gerald Lüttgen, Radu Simin...
EMNLP
2006
15 years 5 months ago
Extremely Lexicalized Models for Accurate and Fast HPSG Parsing
This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the probabilities of parse trees are defined with only the pro...
Takashi Ninomiya, Takuya Matsuzaki, Yoshimasa Tsur...
CGA
2007
15 years 3 months ago
Fast Simulation of Laplacian Growth
— Laplacian instability is the physical mechanism that drives pattern formation in many disparate natural phenomena. However, current algorithms for simulating this instability a...
Theodore Kim, Jason Sewall, Avneesh Sud, Ming C. L...
92
Voted
JCP
2008
86views more  JCP 2008»
15 years 3 months ago
Wordlength Estimation of Digital Controller Synthesis for Inkjet Printer Mechanism
The effect of finite wordlength on coefficients in implementing discrete-time controllers has been a subject of many recent studies. Especially, this issue is more severe in the lo...
Hung-Ming Cheng
128
Voted
JSAT
2008
85views more  JSAT 2008»
15 years 3 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren