Sciweavers

2920 search results - page 148 / 584
» Finite information logic
Sort
View
72
Voted
SIGMETRICS
2008
ACM
15 years 22 days ago
Scheduling despite inexact job-size information
Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of "favoring sm...
Adam Wierman, Misja Nuyens
AIME
2009
Springer
15 years 4 months ago
Data-Efficient Information-Theoretic Test Selection
We use the concept of conditional mutual information (MI) to approach problems involving the selection of variables in the area of medical diagnosis. Computing MI requires estimate...
Marianne Mueller, Rómer Rosales, Harald Ste...
ECCC
2006
120views more  ECCC 2006»
15 years 25 days ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
142
Voted
WAW
2010
Springer
311views Algorithms» more  WAW 2010»
14 years 10 months ago
Game-Theoretic Models of Information Overload in Social Networks
We study the effect of information overload on user engagement in an asymmetric social network like Twitter. We introduce simple game-theoretic models that capture rate competition...
Christian Borgs, Jennifer T. Chayes, Brian Karrer,...
127
Voted
IJCAI
2003
15 years 2 months ago
Minimal Change and Maximal Coherence for Epistemic Logic Program Updates
We consider the problem of updating nonmonotonic knowledge bases represented by epistemic logic programs where disjunctive information and notions of knowledge and beliefs can be ...
Yan Zhang