16666 search results - page 294 / 3334 » Descriptive and Computational Complexity |
187
click to vote
EXPERT
2006
15 years 6 months ago
2006
abstraction rules that hide the complexity of systems of components. We've begun this process in the domain of sensor/actuator network applications, observing that in manyappl...
154
click to vote
GRID
2006
Springer
15 years 6 months ago
2006
Springer
Grids allow large scale resource-sharing across different administrative domains. Those diverse resources are likely to join or quit the Grid at any moment or possibly to break dow...
159
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
173
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
166
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...