Sciweavers

21 search results - page 4 / 5
» Quasi-Steady State - Intuition, Perturbation Theory and Algo...
Sort
View
DLT
2008
13 years 7 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
ATAL
2008
Springer
13 years 7 months ago
Sensing-based shape formation on modular multi-robot systems: a theoretical study
This paper presents a theoretical study of decentralized control for sensing-based shape formation on modular multirobot systems, where the desired shape is specified in terms of ...
Chih-Han Yu, Radhika Nagpal
ENTCS
2008
91views more  ENTCS 2008»
13 years 5 months ago
A Name Abstraction Functor for Named Sets
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
Vincenzo Ciancia, Ugo Montanari
WWW
2005
ACM
14 years 6 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
13 years 11 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