3875 search results - page 711 / 775 » Approximation Algorithms for the Max-coloring Problem |
126
Voted
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
121
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
104
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
130
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
138
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...