Sciweavers

1550 search results - page 106 / 310
» Benchmarking for Graph Transformation
Sort
View
CEC
2009
IEEE
15 years 8 months ago
Grammar-based genetic programming for timetabling
Abstract— We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for prod...
Mohamed Bahy El Bader-El-Den, Riccardo Poli
EURODAC
1994
IEEE
128views VHDL» more  EURODAC 1994»
15 years 7 months ago
A component selection algorithm for high-performance pipelines
The use of a realistic component library with multiple implementations of operators, results in cost ef cient designs; slow components can then be used on non-critical paths and t...
Smita Bakshi, Daniel D. Gajski
ASPDAC
2000
ACM
131views Hardware» more  ASPDAC 2000»
15 years 7 months ago
Reconfigurable synchronized dataflow processor
- This paper describes the design and implementation of a reconfigurable synchronized dataflow processor (RSDP). The RSDP can configure its hardware to directly represent dataflow ...
Hiroshi Sasaki, Hitoshi Maruyama, Hideaki Tsukioka...
120
Voted
JMLR
2010
99views more  JMLR 2010»
14 years 10 months ago
On Combining Graph-based Variance Reduction schemes
In this paper, we consider two variance reduction schemes that exploit the structure of the primal graph of the graphical model: Rao-Blackwellised w-cutset sampling and AND/OR sam...
Vibhav Gogate, Rina Dechter
GG
2010
Springer
15 years 4 months ago
Local Confluence for Rules with Nested Application Conditions
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...