Sciweavers

8109 search results - page 1242 / 1622
» A Model of Component-Based Programming
Sort
View
IFIP
2004
Springer
15 years 11 months ago
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
OOPSLA
2004
Springer
15 years 11 months ago
An aspect-oriented generative approach
Generative programming and aspect-oriented software development have been proposed over the last years aiming at increasing maintainability and reusability of software systems. Wh...
Uirá Kulesza, Alessandro F. Garcia, Carlos ...
RTA
2004
Springer
15 years 11 months ago
A Visual Environment for Developing Context-Sensitive Term Rewriting Systems
Over the past decade, researchers have found context-sensitive term-rewriting semantics to be powerful and expressive tools for modeling programming languages, particularly in esta...
Jacob Matthews, Robert Bruce Findler, Matthew Flat...
SAMOS
2004
Springer
15 years 11 months ago
Self-loop Pipelining and Reconfigurable Dataflow Arrays
Abstract. This paper presents some interesting concepts of static dataflow machines that can be used by reconfigurable computing architectures. We introduce some data-driven reconf...
João M. P. Cardoso
SAT
2004
Springer
95views Hardware» more  SAT 2004»
15 years 11 months ago
Local Search for Very Large SAT Problems
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
Steven David Prestwich, Colin Quirke
« Prev « First page 1242 / 1622 Last » Next »