4485 search results - page 257 / 897 » Equivalences on Observable Processes |
160
click to vote
CORR
2008
Springer
15 years 4 months 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...
152
click to vote
EJC
2008
15 years 4 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
154
click to vote
DAM
2006
15 years 4 months ago
2006
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
135
click to vote
IJAR
2008
15 years 4 months ago
2008
: Based on the setting of exchangeable bets, this paper proposes a subjectivist view of numerical possibility theory. It relies on the assumption that when an agent constructs a pr...
110
click to vote
CN
2007
15 years 4 months ago
2007
—Interactivity in the transport protocol can greatly benefit transport friendly applications generating streaming traffic. Recently we have developed iTCP, which can provide even...