3875 search results - page 757 / 775 » Approximation Algorithms for the Max-coloring Problem |
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study a path planning problem which arises when multiple robots are used to gather data from stationary devices with wireless communication capabilities. Each device has a g...
PAISI
2009
Springer
14 years 2 months ago
2009
Springer
Discovering a representative set of theme patterns from a large amount of text for interpreting their meaning has always been concerned by researches of both data mining and inform...
FOCS
2002
IEEE
14 years 14 days ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
ICALP
2010
Springer
14 years 9 days ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...