Sciweavers

845 search results - page 87 / 169
» Connecting Many-Sorted Theories
Sort
View
EJC
2008
15 years 6 months ago
Eriksson's numbers game and finite Coxeter groups
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
Robert G. Donnelly
ENTCS
2008
64views more  ENTCS 2008»
15 years 6 months ago
General Refinement, Part Two: Flexible Refinement
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
Steve Reeves, David Streader
PE
2008
Springer
81views Optimization» more  PE 2008»
15 years 6 months ago
Using cross-system diversity in heterogeneous networks: Throughput optimization
This paper investigates the situation where a group of terminals can be simultaneously connected to several base stations using distinct technologies on nonoverlapping frequency b...
Samson Lasaulce, Alberto Suárez 0002, Raul ...
MMMACNS
2005
Springer
15 years 11 months ago
Networks, Markov Lie Monoids, and Generalized Entropy
The continuous general linear group in n dimensions can be decomposed into two Lie groups: (1) an n(n-1) dimensional ‘Markov type’ Lie group that is defined by preserving the ...
Joseph E. Johnson
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
15 years 11 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze