Sciweavers

3818 search results - page 101 / 764
» Word Problems on Compressed Words
Sort
View
143
Voted
TCS
2008
15 years 4 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
DAM
1999
90views more  DAM 1999»
15 years 4 months ago
Note on a Helicopter Search Problem on Graphs
We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for th...
Fedor V. Fomin
IPL
2010
80views more  IPL 2010»
15 years 3 months ago
The reachability problem for branching vector addition systems requires doubly-exponential space
Branching vector addition systems are an extension of vector addition systems where new reachable vectors may be obtained by summing two reachable vectors and adding an integral v...
Ranko Lazic
COLING
2010
14 years 11 months ago
Search with Synonyms: Problems and Solutions
Search with synonyms is a challenging problem for Web search, as it can easily cause intent drifting. In this paper, we propose a practical solution to this issue, based on co-cli...
Xing Wei, Fuchun Peng, Huihsin Tseng, Yumao Lu, Xu...
ACL
2010
15 years 2 months ago
Wikipedia as Sense Inventory to Improve Diversity in Web Search Results
Is it possible to use sense inventories to improve Web search results diversity for one word queries? To answer this question, we focus on two broad-coverage lexical resources of ...
Celina Santamaría, Julio Gonzalo, Javier Ar...