Sciweavers

20638 search results - page 3525 / 4128
» Network Computing
Sort
View
EJC
2008
15 years 7 months ago
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...
Jan Foniok, Jaroslav Nesetril, Claude Tardif
CORR
2006
Springer
70views Education» more  CORR 2006»
15 years 7 months ago
Scalable Algorithms for Aggregating Disparate Forecasts of Probability
- In this paper, computational aspects of the panel aggregation problem are addressed. Motivated primarily by applications of risk assessment, an algorithm is developed for aggrega...
Joel B. Predd, Sanjeev R. Kulkarni, Daniel N. Oshe...
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 7 months ago
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
Christian Lavault, Mario Valencia-Pabon
FGCS
2006
83views more  FGCS 2006»
15 years 7 months ago
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
Anne Benoit, Brigitte Plateau, William J. Stewart
COR
2007
143views more  COR 2007»
15 years 7 months ago
A memetic algorithm for channel assignment in wireless FDMA systems
A new problem encoding is devised for the minimum span frequency assignment problem in wireless communications networks which is compact and general. Using the new encoding, which...
Sung-Soo Kim, Alice E. Smith, Jong-Hyun Lee
« Prev « First page 3525 / 4128 Last » Next »