42 search results - page 7 / 9 » On the Maximum Cardinality Search Lower Bound for Treewidth |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
CLUSTER
2005
IEEE
15 years 5 months ago
2005
IEEE
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...
119
click to vote
ISCI
2007
14 years 11 months ago
2007
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
115
click to vote
INFOCOM
1998
IEEE
15 years 3 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
113
Voted
COMGEO
2008
ACM
14 years 11 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...