3466 search results - page 127 / 694 » Fast computation of special resultants |
93
Voted
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...
COMBINATORICS
2004
15 years 21 days ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
This paper deals with pattern rejection strategies for self-paced Brain-Computer Interfaces (BCI). First, it introduces two pattern rejection strategies not used yet for self-pace...
117
click to vote
STACS
2001
Springer
15 years 5 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
119
click to vote
CORR
2008
Springer
15 years 28 days ago
2008
Springer
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...