Sciweavers

69 search results - page 9 / 14
» Answering common questions about code
Sort
View
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 7 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
ATAL
2007
Springer
14 years 1 months ago
Modelling the provenance of data in autonomous systems
Determining the provenance of data, i.e. the process that led to that data, is vital in many disciplines. For example, in science, the process that produced a given result must be...
Simon Miles, Steve Munroe, Michael Luck, Luc Morea...
NETWORK
2008
233views more  NETWORK 2008»
13 years 7 months ago
WhozThat? evolving an ecosystem for context-aware mobile social networks
One of the most compelling social questions, which until now was left unanswered by current technology, is "Who's that?" This question is usually asked about a new ...
Aaron Beach, Mike Gartrell, Sirisha Akkala, Jack E...
CIKM
2007
Springer
14 years 1 months ago
Improving the classification of newsgroup messages through social network analysis
Newsgroup participants interact with their communities through conversation threads. They may respond to a message to answer a question, debate a topic, support or disagree with a...
Blaz Fortuna, Eduarda Mendes Rodrigues, Natasa Mil...
COCOA
2007
Springer
14 years 1 months ago
Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...
Eric J. Friedman, Adam Scott Landsberg