Sciweavers

3229 search results - page 426 / 646
» The Theory of Timed Automata
Sort
View
144
Voted
ICML
2004
IEEE
16 years 7 months ago
Communication complexity as a lower bound for learning in games
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
Vincent Conitzer, Tuomas Sandholm
WWW
2008
ACM
16 years 7 months ago
Recrawl scheduling based on information longevity
It is crucial for a web crawler to distinguish between ephemeral and persistent content. Ephemeral content (e.g., quote of the day) is usually not worth crawling, because by the t...
Christopher Olston, Sandeep Pandey
WWW
2008
ACM
16 years 7 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
CHI
2008
ACM
16 years 7 months ago
The cost of interrupted work: more speed and stress
We performed an empirical study to investigate whether the context of interruptions makes a difference. We found that context does not make a difference but surprisingly, people c...
Gloria Mark, Daniela Gudith, Ulrich Klocke
CHI
2008
ACM
16 years 7 months ago
Crowdsourcing user studies with Mechanical Turk
User studies are important for many aspects of the design process and involve techniques ranging from informal surveys to rigorous laboratory studies. However, the costs involved ...
Aniket Kittur, Ed H. Chi, Bongwon Suh