20 search results - page 4 / 4 » Comparing Universal Covers in Polynomial Time |
TASE
2010
IEEE
12 years 11 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
JCC
2011
12 years 7 months ago
2011
: Docking is one of the most commonly used techniques in drug design. It is used for both identifying correct poses of a ligand in the binding site of a protein as well as for the ...
COCOA
2009
Springer
13 years 8 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
PODC
2009
ACM
14 years 5 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
SODA
1992
ACM
13 years 5 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...