Sciweavers

3736 search results - page 379 / 748
» Hand-Writing Program Generator Generators
Sort
View
CP
2003
Springer
16 years 8 hour ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
ILP
2003
Springer
15 years 12 months ago
ILP for Mathematical Discovery
We believe that AI programs written for discovery tasks will need to simultaneously employ a variety of reasoning techniques such as induction, abduction, deduction, calculation an...
Simon Colton, Stephen Muggleton
ISCA
2010
IEEE
232views Hardware» more  ISCA 2010»
15 years 12 months ago
Data marshaling for multi-core architectures
Previous research has shown that Staged Execution (SE), i.e., dividing a program into segments and executing each segment at the core that has the data and/or functionality to bes...
M. Aater Suleman, Onur Mutlu, José A. Joao,...
CSMR
2002
IEEE
15 years 11 months ago
Evolution Support by Homogeneously Documenting Patterns, Aspects and Traces
The evolution of complex software systems is promoted by software engineering principles and techniques like separation of concerns, encapsulation, stepwise refinement, and reusab...
Johannes Sametinger, Matthias Riebisch
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
15 years 11 months ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek