3875 search results - page 74 / 775 » Approximation Algorithms for the Max-coloring Problem |
AI
2011
Springer
13 years 3 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
DCOSS
2006
Springer
14 years 16 days ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
FAW
2010
Springer
13 years 7 months ago
2010
Springer
The newsvendor problem describes the dilemma of a newspaper salesman—how many papers should he purchase each day to resell, when he doesn’t know the demand? We develop approach...
CLUSTER
2001
IEEE
14 years 15 days ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
MOC
2002
13 years 8 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...