4894 search results - page 682 / 979 » The Guarding Problem - Complexity and Approximation |
168
click to vote
PARA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
124
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an ...
152
click to vote
TEX
2004
Springer
15 years 9 months ago
2004
Springer
This paper summarizes experiences in converting METAFONT fonts to PostScript fonts with TEXtrace and mftrace, based on programs of autotracing bitmaps (AutoTrace and potrace), and...
161
click to vote
IAT
2003
IEEE
15 years 9 months ago
2003
IEEE
A gradient-based method for both symmetric and asymmetric multiagent reinforcement learning is introduced in this paper. Symmetric multiagent reinforcement learning addresses the ...
152
Voted
ICIP
2003
IEEE
15 years 9 months ago
2003
IEEE
Two main issues arise when working in the area of texture segmentation: the need to describe the texture accurately by capturing its underlying structure, and the need to perform ...