WINE
2007
Springer
14 years 6 months ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
WINE
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
WG
2007
Springer
14 years 6 months ago
2007
Springer
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the ...
WDAG
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. Weak fairness guarantees that if an action is continuously enabled, it is executed infinitely often. Strong fairness, on the other hand, guarantees that actions that are...
WDAG
2007
Springer
14 years 6 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
WADS
2007
Springer
14 years 6 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
VMCAI
2007
Springer
14 years 6 months ago
2007
Springer
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
VLDB
2007
ACM
14 years 6 months ago
2007
ACM
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
VISUAL
2007
Springer
14 years 6 months ago
2007
Springer
An application for content-based annotation and retrieval of videos can be found in the sport domain, where videos are annotated in order to produce short summaries for news and sp...
STACS
2007
Springer
14 years 6 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...