Sciweavers

344 search results - page 67 / 69
» Banach-Mazur Games on Graphs
Sort
View
CLIMA
2010
13 years 9 months ago
Exploring the Boundary of Half Positionality
Half positionality is the property of a language of infinite words to admit positional winning strategies, when interpreted as the goal of a two-player game on a graph. Such proble...
Alessandro Bianco, Marco Faella, Fabio Mogavero, A...
JCT
1998
193views more  JCT 1998»
13 years 7 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 10 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
SIGIR
2010
ACM
13 years 11 months ago
Exploring the use of labels to shortcut search trails
Search trails comprising queries and Web page views are created as searchers engage in information-seeking activity online. During known-item search (where the objective may be to...
Ryen W. White, Raman Chandrasekar
AIIDE
2008
13 years 9 months ago
A Cover-Based Approach to Multi-Agent Moving Target Pursuit
We explore the task of designing an efficient multi-agent system that is capable of capturing a single moving target, assuming that every agent knows the location of all agents on...
Alejandro Isaza, Jieshan Lu, Vadim Bulitko, Russel...