Sciweavers

10935 search results - page 2006 / 2187
» Neural Programming Language
Sort
View
CP
2007
Springer
15 years 7 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
EMSOFT
2007
Springer
15 years 7 months ago
The revenge of the overlay: automatic compaction of OS kernel code via on-demand code loading
There is increasing interest in using general-purpose operating systems, such as Linux, on embedded platforms. It is especially important in embedded systems to use memory effici...
Haifeng He, Saumya K. Debray, Gregory R. Andrews
EUROSSC
2007
Springer
15 years 7 months ago
Capturing Context Requirements
Context-aware applications require context information to adapt their behaviour to the current situation. When developing context-aware applications, application developers need to...
Tom Broens, Dick A. C. Quartel, Marten van Sindere...
FOSSACS
2007
Springer
15 years 7 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
FROCOS
2007
Springer
15 years 7 months ago
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
Beatriz Alarcón, Salvador Lucas
« Prev « First page 2006 / 2187 Last » Next »