279 search results - page 52 / 56 » Type-II Optimal Polynomial Bases |
APPROX
2011
Springer
12 years 8 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
SECON
2010
IEEE
13 years 6 months ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
MOBIHOC
2005
ACM
14 years 8 months ago
2005
ACM
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels ca...
AB
2007
Springer
14 years 2 months ago
2007
Springer
A series of papers, all under the title of Algorithmic Algebraic Model Checking (AAMC), has sought to combine techniques from algorithmic algebra, model checking and dynamical syst...