Sciweavers

105 search results - page 18 / 21
» Linear Time Algorithm for Weak Parity Games
Sort
View
SIGMETRICS
2004
ACM
118views Hardware» more  SIGMETRICS 2004»
14 years 1 months ago
A game theoretic approach to provide incentive and service differentiation in P2P networks
Traditional Peer-to-Peer (P2P) networks do not provide service differentiation and incentive for users. Consequently, users can easily access information without contributing any ...
Richard T. B. Ma, Sam C. M. Lee, John C. S. Lui, D...
COMPGEOM
1993
ACM
13 years 12 months ago
Approximating Center Points with Iterated Radon Points
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
14 years 2 months ago
Distributed motion constraints for algebraic connectivity of robotic networks
— This paper studies connectivity maintenance of robotic networks that communicate at discrete times and move in continuous space. We propose a distributed algorithm that allows ...
Michael Schuresko, Jorge Cortés
AAMAS
2011
Springer
13 years 2 months ago
Long-term fairness with bounded worst-case losses
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
Gabriel Catalin Balan, Dana Richards, Sean Luke
LATA
2009
Springer
14 years 2 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle