Sciweavers

49 search results - page 1 / 10
» Can Losing Lead to Winning
Sort
View
MANSCI
2011
12 years 7 months ago
Can Losing Lead to Winning?
Jonah Berger, Devin Pope
CG
2002
Springer
13 years 4 months ago
New Winning and Losing Positions for 7x7 HEx
Abstract. In this paper, we applied the decomposition method to obtain a new winning strategy for 7x7 Hex. We also found that some positions on the 7x7 Hex board, called trivial po...
Jing Yang, Simon X. Liao, Miroslaw Pawlak
ICANN
2005
Springer
13 years 10 months ago
Evolution of Heuristics for Give-Away Checkers
The efficacy of two evolutionary approaches to the problem of generation of heuristical linear and non-linear evaluation functions in the game of give-away checkers is tested in th...
Magdalena Kusiak, Karol Waledzik, Jacek Mandziuk
ICALP
2007
Springer
13 years 8 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis
ICC
2007
IEEE
105views Communications» more  ICC 2007»
13 years 11 months ago
Mean Time to Lose Lock for a PLL with Loop Delay under Thermal and Phase Noise Conditions
—The growing demand for reliable communications leads to the need for very large mean time to lose lock (MTLL) of PLL based synchronization subsystems. These large MTLLs, of the ...
Uri Yehuday, Ben-Zion Bobrovsky, Jeffrey Davidson