1272 search results - page 26 / 255 » The Set Cover with Pairs Problem |
118
click to vote
DCOSS
2010
Springer
15 years 26 days ago
2010
Springer
Synchronization is widely considered as an important service in distributed systems which may simplify protocol design. Phase clock is a general synchronization tool that provides ...
138
Voted
CCCG
2006
15 years 2 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
101
click to vote
COMPGEOM
1997
ACM
15 years 4 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
120
Voted
AI
2001
Springer
15 years 5 months ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
158
Voted
DAM
2011
14 years 7 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...