Sciweavers

4372 search results - page 225 / 875
» Algorithmic Theories of Everything
Sort
View
LPNMR
2011
Springer
14 years 8 months ago
What Are the Necessity Rules in Defeasible Reasoning?
This paper investigates a new approach for computing the inference of defeasible logic. The algorithm proposed can substantially reduced the theory size increase due to transformat...
Ho-Pun Lam, Guido Governatori
ICCV
2005
IEEE
16 years 7 months ago
A New Framework for Approximate Labeling via Graph Cuts
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Nikos Komodakis, Georgios Tziritas
WWW
2005
ACM
16 years 6 months ago
Information flow using edge stress factor
This paper shows how a corpus of instant messages can be employed to detect de facto communities of practice automatically. A novel algorithm based on the concept of Edge Stress F...
Franco Salvetti, Savitha Srinivasan
PODC
2006
ACM
15 years 11 months ago
Timeliness, failure-detectors, and consensus performance
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
Idit Keidar, Alexander Shraer
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
15 years 10 months ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...