3663 search results - page 546 / 733 » Problems in the ontology of computer programs |
148
click to vote
ICALP
2005
Springer
16 years 1 days ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
154
click to vote
ICALP
2005
Springer
16 years 1 days ago
2005
Springer
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
157
click to vote
ICALP
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
137
click to vote
ICALP
2005
Springer
16 years 1 days ago
2005
Springer
We investigate the decidability of observational equivalence and approximation in “Syntactic Control of Interference” (SCI). By asg denotations of terms in an inequationally fu...
151
click to vote
ISMIR
2005
Springer
16 years 22 hour ago
2005
Springer
In this paper we propose a text represention for musical chord symbols that is simple and intuitive for musically trained individuals to write and understand, yet highly structure...