1653 search results - page 237 / 331 » Computer science and game theory |
109
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
106
click to vote
SOFSEM
1999
Springer
15 years 3 months ago
1999
Springer
We study learning scenarios in which multiple learners are involved and “nature” imposes some constraints that force the predictions of these learners to behave coherently. Thi...
FOCS
1994
IEEE
15 years 3 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
77
Voted
EXPCS
2007
15 years 3 months ago
2007
XML simplifies data exchange among heterogeneous computers, but it is notoriously verbose and has spawned the development of many XML-specific compressors and binary formats. We p...
100
click to vote
SIGOPS
2008
14 years 11 months ago
2008
During the last three years, we have been experimenting with the use of the Uppaal model checker in an introductory course on operating systems for first-year Computer Science stu...