Sciweavers

1568 search results - page 180 / 314
» The problem of examination questions in algorithmics
Sort
View
WWW
2008
ACM
15 years 6 months ago
Discovering geographical-specific interests from web click data
As the Internet continues to play an important role in many business applications, it becomes vital to increase the competitive edge by offering geographically tailored contents t...
Chang Sheng, Wynne Hsu, Mong-Li Lee
AI
1999
Springer
15 years 6 months ago
Emergent Cooperative Goal-Satisfaction in Large Scale Automated-Agent Systems
Cooperation among autonomous agents has been discussed in the DAI community for several years. Papers about cooperation 6,45 , negotiation 33 , distributed planning 5 , and coalit...
Onn Shehory, Sarit Kraus, Osher Yadgar
PAMI
2011
14 years 9 months ago
Meta-Recognition: The Theory and Practice of Recognition Score Analysis
Abstract—In this paper, we define meta-recognition, a performance prediction method for recognition algorithms, and examine the theoretical basis for its post-recognition score ...
Walter J. Scheirer, Anderson Rocha, Ross J. Michea...
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
16 years 11 days ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
CIE
2007
Springer
16 years 18 days ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer