1615 search results - page 174 / 323 » Computer science and decision theory |
86
Voted
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
121
click to vote
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
88
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Design by contract is a well known theory that views software construction as based on contracts between clients (callers) and suppliers (routines), relying on mutual obl...
128
Voted
AR
2007
15 years 28 days ago
2007
—Researchers in robotics and artificial intelligence have often looked at biology as a source of inspiration for solving their problems. From the opposite perspective, neuroscie...
112
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...