Sciweavers

11949 search results - page 376 / 2390
» Some results on (a:b)-choosability
Sort
View
MFCS
1998
Springer
15 years 5 months ago
One Guess One-Way Cellular Arrays
One-way cellular automata with restricted nondeterminism are investigated. The number of allowed nondeterministic state transitions is limited to a constant. It is shown that a lim...
Thomas Buchholz, Andreas Klein, Martin Kutrib
ICSE
2000
IEEE-ACM
15 years 5 months ago
Software process: a roadmap
Software process research deals with the methods and technologies used to assess, support, and improve software development activities. The field has grown up during the 80s to ad...
Alfonso Fuggetta
133
Voted
IWMM
2000
Springer
144views Hardware» more  IWMM 2000»
15 years 5 months ago
Memory Allocation with Lazy Fits
Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy ...
Yoo C. Chung, Soo-Mook Moon
MFCS
2000
Springer
15 years 5 months ago
Periodic-Like Words
In this paper we investigate the periodic structure of rich words (i.e., words having the highest possible number of palindromic factors), giving new results relating them with per...
Arturo Carpi, Aldo de Luca
MPC
2000
Springer
105views Mathematics» more  MPC 2000»
15 years 5 months ago
The Universal Resolving Algorithm: Inverse Computation in a Functional Language
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
Sergei M. Abramov, Robert Glück