Sciweavers

4074 search results - page 375 / 815
» Abstract Graph Transformation
Sort
View
IPPS
1998
IEEE
15 years 11 months ago
Random Sampling Techniques in Parallel Computation
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
Rajeev Raman
FSTTCS
1994
Springer
15 years 10 months ago
Finite-State Strategies in Regular Infinite Games
Abstract. This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller ...
Wolfgang Thomas
161
Voted
IPCO
2010
141views Optimization» more  IPCO 2010»
15 years 8 months ago
The Price of Collusion in Series-Parallel Networks
Abstract. We study the quality of equilibrium in atomic splittable routing games. We show that in single-source single-sink games on seriesparallel graphs, the price of collusion -...
Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang
ERCIMDL
2010
Springer
158views Education» more  ERCIMDL 2010»
15 years 7 months ago
Ranking Entities Using Web Search Query Logs
Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
Bodo Billerbeck, Gianluca Demartini, Claudiu S. Fi...
CORR
2007
Springer
151views Education» more  CORR 2007»
15 years 6 months ago
The Complexity of Games on Higher Order Pushdown Automata
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
Thierry Cachat, Igor Walukiewicz