Sciweavers

7758 search results - page 391 / 1552
» On the Number of Distributive Lattices
Sort
View
FOCS
2008
IEEE
15 years 8 months ago
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
Siu On Chan, Michael Molloy
ICA3PP
2010
Springer
15 years 7 months ago
Checkpointing and Migration of Communication Channels in Heterogeneous Grid Environments
Abstract. A grid checkpointing service providing migration and transparent fault tolerance is important for distributed and parallel applications executed in heterogeneous grids. I...
John Mehnert-Spahn, Michael Schoettner
DM
2008
104views more  DM 2008»
15 years 6 months ago
On edge-weighted recursive trees and inversions in random permutations
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...
Markus Kuba, Alois Panholzer
JCM
2008
76views more  JCM 2008»
15 years 6 months ago
Waterfilling Estimation for AWGN MIMO Channel Modeled as a Random Matrix
Waterfilling solutions provide optimal power distribution in multiple-input multiple-output (MIMO) system design. However, the optimal distribution is usually obtained through cost...
Victor M. Vergara, Silvio E. Barbin, Ramiro Jordan
CORR
2004
Springer
91views Education» more  CORR 2004»
15 years 6 months ago
Metrics for more than two points at once
The conventional definition of a topological metric over a space specifies properties that must be obeyed by any measure of "how separated" two points in that space are....
David Wolpert