Sciweavers

485 search results - page 7 / 97
» Iterative Bounding LAO
Sort
View
ICDT
1997
ACM
138views Database» more  ICDT 1997»
15 years 2 months ago
Tractable Iteration Mechanisms for Bag Languages
Abstract. The goal of this paper is to study tractable iteration mechanisms for bags. The presence of duplicates in bags prevents iteration mechanisms developed in the context of s...
Latha S. Colby, Leonid Libkin
DCG
2010
57views more  DCG 2010»
14 years 10 months ago
Iterated Point-Line Configurations Grow Doubly-Exponentially
Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and ...
Joshua Cooper, Mark Walters
CORR
2010
Springer
115views Education» more  CORR 2010»
14 years 10 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
LICS
2009
IEEE
15 years 4 months ago
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
Oliver Friedmann
SIGECOM
2005
ACM
90views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
ICE: an iterative combinatorial exchange
We present the first design for a fully expressive iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language that is concise and expressive ...
David C. Parkes, Ruggiero Cavallo, Nick Elprin, Ad...