Sciweavers

4372 search results - page 107 / 875
» Algorithmic Theories of Everything
Sort
View

Lecture Notes
357views
15 years 8 months ago
Online Mechanisms
in Algorithmic Game Theory, Noam Nisan, Tim Roughgarden, Eva Tardos and Vijay Vazirani (eds.), Chapter 16, Cambrige University Press, 2007
David Parkes
ALT
2008
Springer
14 years 5 months ago
Prequential Randomness
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincid...
Vladimir Vovk, Alexander Shen
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
14 years 15 days ago
Structure and metaheuristics
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
Yossi Borenstein, Riccardo Poli
IJSR
2011
74views more  IJSR 2011»
13 years 3 months ago
Acting Deceptively: Providing Robots with the Capacity for Deception
Deception is utilized by a variety of intelligent systems ranging from insects to human beings. It has been argued that the use of deception is an indicator of theory of mind [2] ...
Alan R. Wagner, Ronald C. Arkin
IWOCA
2010
Springer
229views Algorithms» more  IWOCA 2010»
13 years 3 months ago
Ranking and Drawing in Subexponential Time
In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimiza...
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov,...