Results 1 - 6 of 6

Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games

by Oliver Friedmann, Thomas Dueholm, Hansen Uri Zwick , 2014
"... In [Friedmann, Hansen, and Zwick (2011)] and we claimed that the expected number of pivoting steps performed by the Random-Facet algorithm of Kalai and of Matoušek, Sharir, and Welzl is equal to the expected number of pivoting steps performed by Random-Facet∗, a variant of Random-Facet that bases i ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
its random decisions on one random permutation. We then obtained a lower bound on the expected number of pivoting steps performed by Random-Facet ∗ and claimed that the same lower bound holds also for Random-Facet. Unfortunately, the claim that the expected number of steps performed by Random-Facet

A subexponential lower bound for the Random Facet algorithm for Parity Games

by Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
"... Parity Games form an intriguing family of infinite duration games whose solution is equivalent to the solution of important problems in automatic verification and automata theory. They also form a very natural subclass of Deterministic Mean Payoff Games, which in turn is a very natural subclass of t ..."
Abstract - Cited by 6 (5 self) - Add to MetaCart
Matouˇsek, Sharir and Welzl as the Random Facet algorithm. The expected running time of these algorithmsis subexponential in the size of the game, i.e., 2

Chapter 12 Rough Sets and Rough Logic: A KDD Perspective

by Zdzis Law Pawlak, Lech Polkowski, Andrzej Skowron
"... Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con ..."
Abstract - Add to MetaCart
Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations

TO CODE OR NOT TO CODE

by Présentée À La, Faculté Informatique, Et Communications, Section Des, Systèmes De Communication, Du Grade, De Docteur, Ès Sciences, Prof M. Vetterli, Prof B. Rimoldi, Prof R. Gallager, Prof A. Lapidoth, Prof J. Massey, Prof E. Telatar, Prof S. Verdú, Michael Gastpar, Amos Lapidoth, Jim Ma , 2002
"... de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury: ..."
Abstract - Add to MetaCart
de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury:

Physics

by Daniel Alexander Pertot, Jacobus Verbaarschot, Two-component Bosons In, Daniel Alexander Pertot , 2011
"... Ultracold atoms in optical lattices provide a highly control-lable environment for the clean experimental realization of various model Hamiltonians from condensed matter and statistical physics. For example, the two-component Bose-Hubbard model, which re-duces to an anisotropic spin-1/2 Heisenberg m ..."
Abstract - Add to MetaCart
Ultracold atoms in optical lattices provide a highly control-lable environment for the clean experimental realization of various model Hamiltonians from condensed matter and statistical physics. For example, the two-component Bose-Hubbard model, which re-duces to an anisotropic spin-1/2 Heisenberg

Approved by:

by Christopher Charles Weigle, Russell M. Taylor Ii, Elizabeth Bullitt Reader, Christopher G. Healey, Stephen M. Pizer, Mary Whitton, Reader C, Christopher Charles Weigle , 2006
"... ii iii CHRISTOPHER CHARLES WEIGLE: Displays for Exploration and Comparison of Nested ..."
Abstract - Add to MetaCart
ii iii CHRISTOPHER CHARLES WEIGLE: Displays for Exploration and Comparison of Nested
Results 1 - 6 of 6