Sciweavers

4013 search results - page 106 / 803
» computing 2002
Sort
View
CORR
2002
Springer
96views Education» more  CORR 2002»
15 years 2 months ago
A computer scientist looks at game theory
I consider issues in distributed computation that should be of relevance to game theory. In particular, I focus on (a) representing knowledge and uncertainty, (b) dealing with fai...
Joseph Y. Halpern
EOR
2002
68views more  EOR 2002»
15 years 2 months ago
The computational complexity of the criticality problems in a network with interval activity times
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
Stefan Chanas, Pawel Zielinski
TCS
2002
15 years 2 months ago
An example of a computable absolutely normal number
The first example of an absolutely normal number was given by Sierpinski in 1916, twenty years before the concept of computability was formalized. In this note we give a recursive...
Verónica Becher, Santiago Figueira
COLING
2002
15 years 2 months ago
Computation of Modifier Scope in NP by a Language-neutral Method
The relative logical scope of multiple modifiers within NP is often semantically significant. This paper proposes a structurally based method for computing the relative scope of s...
Richard Campbell
AAECC
2002
Springer
116views Algorithms» more  AAECC 2002»
15 years 2 months ago
A Computer Proof of a Series Evaluation in Terms of Harmonic Numbers
A fruitful interaction between a new randomized WZ procedure and other computer algebra programs is illustrated by the computer proof of a series evaluation that originates from a ...
Russell Lyons, Peter Paule, Axel Riese