2979 search results - page 509 / 596 » Computation and the Periodic Table |
JSSPP
2009
Springer
14 years 4 months ago
2009
Springer
In parallel systems, similar jobs tend to arrive within bursty periods. This fact leads to the existence of the locality phenomenon, a persistent similarity between nearby jobs, in...
PODS
1994
ACM
14 years 2 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
BIB
2006
13 years 10 months ago
2006
: In recent years, as a knowledge-based discipline, bioinformatics has moved to make its knowledge more computationally amenable. After its beginnings in the disciplines as a techn...
CHI
2008
ACM
14 years 10 months ago
2008
ACM
We designed an activity-based prototyping process realized in the ActivityDesigner system that combines the theoretical framework of Activity-Centered Design with traditional iter...
STACS
2010
Springer
14 years 5 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...