Sciweavers

11909 search results - page 2215 / 2382
» The Scheme Programming Language
Sort
View
IFIP
2004
Springer
14 years 3 months ago
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
Paola Flocchini, Antonio Mesa Enriques, Linda Pagl...
IFIP
2004
Springer
14 years 3 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack
IFIP
2004
Springer
14 years 3 months ago
Solving Packing Problem with Weaker Block Solvers
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
Hu Zhang
ISMIR
2004
Springer
114views Music» more  ISMIR 2004»
14 years 3 months ago
CsoundXML: a meta-language in XML for sound synthesis
The software sound synthesis is closely related to the Music N programs started with Music I in 1957. Although Music N has many advantages such as unit generators and a flexible ...
Pedro Kröger
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
14 years 3 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
« Prev « First page 2215 / 2382 Last » Next »