2899 search results - page 537 / 580 » Dynamic Trees in Practice |
ICALP
2003
Springer
14 years 3 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
CCO
2001
Springer
14 years 2 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
KDD
1999
ACM
14 years 2 months ago
1999
ACM
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
NATO
1993
14 years 2 months ago
1993
METU Object-Oriented DBMS 1 includes the implementation of a database kernel, an object-oriented SQL-like language and a graphical user interface. Kernel functions are divided bet...