Sciweavers

355 search results - page 19 / 71
» On Ramsey-type positional games
Sort
View
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
14 years 9 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
ACG
2009
Springer
14 years 3 months ago
Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K
Retrograde analysis is a tool for reconstructing a game tree starting from its leaves; with these techniques one can solve specific subsets of a complex game, achieving optimal pl...
Paolo Ciancarini, Gian Piero Favini
CPC
2010
74views more  CPC 2010»
13 years 6 months ago
Playing to Retain the Advantage
Let P be a monotone increasing graph property, let G = (V, E) be a graph, and let q be a positive integer. In this paper, we study the (1 : q) Maker-Breaker game, played on the ed...
Noga Alon, Dan Hefetz, Michael Krivelevich
PCM
2007
Springer
160views Multimedia» more  PCM 2007»
14 years 2 months ago
3D Tracking of a Soccer Ball Using Two Synchronized Cameras
Abstract. We propose an adaptive method that can estimate 3D position of a soccer ball by using two viewpoint videos. The 3D position of a ball is essential to realize a 3D free vi...
Norihiro Ishii, Itaru Kitahara, Yoshinari Kameda, ...
IPL
2008
98views more  IPL 2008»
13 years 8 months ago
On the number of Go positions on lattice graphs
We use transfer matrix methods to determine bounds for the numbers of legal Go positions for various numbers of players on some planar lattice graphs, including square lattice gra...
Graham Farr, Johannes Schmidt