322 search results - page 64 / 65 » Combinations of Abstract Domains for Logic Programming |
186
click to vote
KES
1999
Springer
15 years 10 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
205
click to vote
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
179
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
233
click to vote
FCCM
2011
IEEE
14 years 10 months ago
2011
IEEE
— Recent progress in High-Level Synthesis (HLS) es has helped raise the abstraction level of FPGA programming. However implementation and performance evaluation of the HLS-genera...
197
click to vote
OOPSLA
2010
Springer
15 years 4 months ago
2010
Springer
Domain-specific languages offer high expressive power foa particular problem domain, abstracting over the accidental complexity associated with traditional software development. ...