Sciweavers

1220 search results - page 129 / 244
» Restricting grammatical complexity
Sort
View
DATE
2000
IEEE
140views Hardware» more  DATE 2000»
14 years 8 days ago
Resolution of Dynamic Memory Allocation and Pointers for the Behavioral Synthesis from C
-- One of the greatest challenges in C/C++-based design methodology is to efficiently map C/C++ models into hardware. Many of the networking and multimedia applications implemente...
Luc Séméria, Koichi Sato, Giovanni D...
CP
2000
Springer
14 years 6 days ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
ICDT
2010
ACM
125views Database» more  ICDT 2010»
13 years 12 months ago
Synthesizing View Definitions from Data
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
Anish Das Sarma, Aditya Parameswaran, Hector Garci...
FCCM
2009
IEEE
147views VLSI» more  FCCM 2009»
13 years 11 months ago
FPGA Accelerated Simulation of Biologically Plausible Spiking Neural Networks
Artificial neural networks are a key tool for researchers attempting to understand and replicate the behaviour and intelligence found in biological neural networks. Software simul...
David Thomas, Wayne Luk
BPM
2006
Springer
105views Business» more  BPM 2006»
13 years 11 months ago
Verifying Workflows with Cancellation Regions and OR-Joins: An Approach Based on Reset Nets and Reachability Analysis
When dealing with complex business processes (e.g., in the context of a workflow implementation or the configuration of some process-aware information system), it is important but ...
Moe Thandar Wynn, Wil M. P. van der Aalst, Arthur ...