Sciweavers

14084 search results - page 89 / 2817
» A Theory for Game Theories
Sort
View
CORR
2011
Springer
140views Education» more  CORR 2011»
12 years 12 months ago
Bias-Driven Revision of Logical Domain Theories
The theory revision problem is the problem of how best to go about revising a deficient domain theory using information contained in examples that expose inaccuracies. In this pa...
Ronen Feldman, Moshe Koppel, Alberto Maria Segre
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
14 years 8 months ago
Balanced max 2-sat might not be the hardest
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Per Austrin
IJCNN
2008
IEEE
14 years 2 months ago
Knowledge representation and acquisition for large-scale semantic memory
Abstract—Acquisition and representation of semantic concepts is a necessary requirement for the understanding of natural languages by cognitive systems. Word games provide an int...
Julian Szymanski, Wlodzislaw Duch
AI
2008
Springer
13 years 8 months ago
Fault tolerant mechanism design
We introduce the notion of fault tolerant mechanism design, which extends the standard game theoretic framework of mechanism design to allow for uncertainty about execution. Speci...
Ryan Porter, Amir Ronen, Yoav Shoham, Moshe Tennen...
CORR
2007
Springer
84views Education» more  CORR 2007»
13 years 8 months ago
Undirected Graphs of Entanglement Two
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale