2168 search results - page 186 / 434 » Randomized Algorithms and Complexity Theory |
141
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Researchers in the social and behavioral sciences routinely rely on quasi-experimental designs to discover knowledge from large databases. Quasi-experimental designs (QEDs) exploi...
137
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
166
Voted
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
122
Voted
NIPS
2008
15 years 5 months ago
2008
We investigate a topic at the interface of machine learning and cognitive science. Human active learning, where learners can actively query the world for information, is contraste...
128
click to vote
ATAL
2001
Springer
15 years 8 months ago
2001
Springer
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...