Sciweavers

684 search results - page 96 / 137
» A characterization of b-perfect graphs
Sort
View
82
Voted
CORR
2010
Springer
101views Education» more  CORR 2010»
14 years 12 months ago
Distributed anonymous discrete function computation
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
Julien M. Hendrickx, Alexander Olshevsky, John N. ...
CORR
2008
Springer
154views Education» more  CORR 2008»
14 years 12 months ago
Best-Effort Strategies for Losing States
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
Marco Faella
ARSCOM
2006
81views more  ARSCOM 2006»
14 years 12 months ago
A Counting of the minimal realizations of the posets of dimension two
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
Pierre Ille, Jean-Xavier Rampon
FUIN
2007
122views more  FUIN 2007»
14 years 11 months ago
Behaviour Algebras
The paper is concerned with algebras whose elements can be used to represent runs of a system, called processes. These algebras, called behaviour algebras, are categories with resp...
Józef Winkowski
AML
2005
84views more  AML 2005»
14 years 11 months ago
Modularity of proof-nets
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
Roberto Maieli, Quintijn Puite