Sciweavers

11909 search results - page 2190 / 2382
» The Scheme Programming Language
Sort
View
CP
2007
Springer
14 years 4 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
14 years 4 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
14 years 4 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...
FROCOS
2007
Springer
14 years 4 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
ICALP
2007
Springer
14 years 4 months ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle
« Prev « First page 2190 / 2382 Last » Next »