Sciweavers

5995 search results - page 232 / 1199
» Algorithmic Game Theory
Sort
View
CCCG
2008
15 years 6 months ago
Computational Balloon Twisting: The Theory of Balloon Polyhedra
This paper builds a general mathematical and algorithmic theory for balloon-twisting structures, from balloon animals to balloon polyhedra, by modeling their underlying graphs (ed...
Erik D. Demaine, Martin L. Demaine, Vi Hart
ICANNGA
2007
Springer
120views Algorithms» more  ICANNGA 2007»
15 years 11 months ago
Evolutionary Approach to the Game of Checkers
A new method of genetic evolution of linear and nonlinear evaluation functions in the game of checkers is presented. Several practical issues concerning application of genetic algo...
Magdalena Kusiak, Karol Waledzik, Jacek Mandziuk
FOCS
2007
IEEE
15 years 11 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
ICCV
2009
IEEE
16 years 10 months ago
A Theory of Active Object Localization
We present some theoretical results related to the problem of actively searching for a target in a 3D environment, under the constraint of a maximum search time. We define the o...
Alexander Andreopoulos, John K. Tsotsos
PODS
2003
ACM
151views Database» more  PODS 2003»
16 years 5 months ago
Feasible itemset distributions in data mining: theory and application
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
Ganesh Ramesh, William Maniatty, Mohammed Javeed Z...