11211 search results - page 1811 / 2243 » Data Structures |
188
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
175
click to vote
JDA
2008
15 years 6 months ago
2008
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
176
click to vote
CVGIP
2007
15 years 6 months ago
2007
We address the difficult open problem of emulating the rich complexity of real pedestrians in urban environments. Our artificial life approach integrates motor, perceptual, beha...
197
click to vote
LISP
2008
15 years 6 months ago
2008
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
184
click to vote
ENTCS
2007
15 years 6 months ago
2007
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...