Sciweavers

336 search results - page 24 / 68
» Harmonic evolutions on graphs
Sort
View
ENTCS
2008
114views more  ENTCS 2008»
13 years 10 months ago
Maintaining Coherence Between Models With Distributed Rules: From Theory to Eclipse
Integrated Development Environments supporting software and model evolution have to deal with the problem of maintaining coherence between code and model despite changes which may...
Paolo Bottoni, Francesco Parisi-Presicce, Simone P...
GLOBECOM
2006
IEEE
14 years 3 months ago
Content Delivery in Overlay Networks: a Stochastic Graph Processes Perspective
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
14 years 3 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
DISOPT
2010
129views more  DISOPT 2010»
13 years 10 months ago
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
Basile Couëtoux, Laurent Gourvès, J&ea...
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
13 years 9 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller