Sciweavers

4047 search results - page 159 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
EUSFLAT
2007
128views Fuzzy Logic» more  EUSFLAT 2007»
15 years 7 months ago
Intersections Between Basic Families of Fuzzy Implications: (S, N)-, R- and QL-Implications
In this work, our primary focus is to determine the intersections that exist between the family of QL-implications and the families of (S, N)- and R-implications. Toward this end,...
Balasubramaniam Jayaram, Michal Baczynski
JSAC
2008
98views more  JSAC 2008»
15 years 6 months ago
Randomized consensus algorithms over large scale networks
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
Fabio Fagnani, Sandro Zampieri
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 7 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
FOSSACS
2009
Springer
16 years 1 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 6 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...