1132 search results - page 153 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
148
click to vote
AAAI
2010
15 years 7 months ago
2010
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
164
click to vote
OPODIS
2007
15 years 7 months ago
2007
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
140
click to vote
FLAIRS
2006
15 years 7 months ago
2006
We are exploring the differences between expert and less expert tutors with two goals: cognitive (what does tutoring tell us about learning) and applied (which features of tutorin...
166
click to vote
IJCAI
2003
15 years 7 months ago
2003
Often the most expensive and time-consuming task in building a pattern recognition system is col lecting and accurately labeling training and testing data. In this paper, we exp...
134
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...