1275 search results - page 209 / 255 » time 1998 |
GIS
1998
ACM
13 years 8 months ago
1998
ACM
Abstract. Crime pattern analysis has tended to focus on `hotspot’ analysis techniques; the identi® cation of areas with higher densities of criminal activity. This paper documen...
IJFCS
1998
13 years 8 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
IPL
1998
13 years 8 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
IWC
1998
13 years 8 months ago
1998
An experiment was carried out to estimate the effect of auditory alarms on the work of an plant operator in the context of a computer simulation. We designed our process simulator...
JACM
1998
13 years 8 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...