4378 search results - page 123 / 876 » On the Complexity of Ordered Colourings |
JCST
2010
13 years 5 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
ICC
2009
IEEE
14 years 4 months ago
2009
IEEE
— In this paper, we propose a novel low complexity soft-in soft-out (SISO) equalizer using the Markov chain Monte Carlo (MCMC) technique. Direct application of MCMC to SISO equal...
HPCC
2007
Springer
14 years 4 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
WDAG
2007
Springer
14 years 4 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
VTC
2006
IEEE
14 years 4 months ago
2006
IEEE
— Iterative equalization has emerged as an efficient means of achieving near-capacity detection performance in multiple-antenna (MIMO) systems. However, many proposed detection ...