1040 search results - page 107 / 208 » Rounding algorithms for covering problems |
SWAT
1994
Springer
15 years 1 months ago
1994
Springer
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
162
click to vote
VSTTE
2012
Springer
13 years 5 months ago
2012
Springer
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Recently network virtualization has been proposed as a promising way to overcome the current ossification of the Internet by allowing multiple heterogeneous virtual networks (V...
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
We discuss the problem of concurrent error detection (CED) with bounded latency in finite state machines (FSMs). The objective of this approach is to reduce the overhead of CED, a...