400 search results - page 31 / 80 » Derandomization and Distinguishing Complexity |
109
click to vote
KR
1998
Springer
15 years 6 months ago
1998
Springer
Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description langua...
108
click to vote
CMSB
2006
Springer
15 years 5 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
TAPSOFT
1991
Springer
15 years 5 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
VISSYM
2004
15 years 3 months ago
2004
Climateprediction.net aims to harness the spare CPU cycles of a million individual users' PCs to run a massive ensemble of climate simulations using an up-to-date, full-scale...
120
click to vote
WSC
2001
15 years 3 months ago
2001
This paper describes a novel method for detecting the bottleneck in a discrete event system by examining the average duration of a machine being active for all machines. The machi...