Sciweavers

2227 search results - page 182 / 446
» Reversibility and Models for Concurrency
Sort
View
HPCC
2007
Springer
16 years 23 days ago
Parallel Database Sort and Join Operations Revisited on Grids
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
Werner Mach, Erich Schikuta
SCAM
2003
IEEE
15 years 12 months ago
Parse-Tree Annotations Meet Re-Engineering Concerns
We characterise a computational model for processing annotated parse trees. The model is basically rewriting-based with specific provisions for dealing with annotations along the...
Jan Kort, Ralf Lämmel
DNA
2003
Springer
15 years 12 months ago
One Dimensional Boundaries for DNA Tile Self-Assembly
In this paper we report the design and synthesis of DNA molecules (referred to as DNA tiles) with specific binding interactions that guide self-assembly to make one-dimensional as...
Rebecca Schulman, Shaun Lee, Nick Papadakis, Erik ...
190
Voted
IWPC
2002
IEEE
15 years 11 months ago
Theory-based Analysis of Cognitive Support in Software Comprehension Tools
Past research on software comprehension tools has produced a wealth of lessons in building good tools. However our explanations of these tools tends to be weakly grounded in exist...
Andrew Walenstein
FUN
2010
Springer
306views Algorithms» more  FUN 2010»
15 years 11 months ago
Leveling-Up in Heroes of Might and Magic III
We propose a model for level-ups in Heroes of Might and Magic III, and give an O 1 ε2 ln 1 δ learning algorithm to estimate the probabilities of secondary skills induced by any ...
Dimitrios I. Diochnos