42738 search results - page 277 / 8548 » Search Computing Systems |
113
click to vote
GMP
2000
IEEE
15 years 8 months ago
2000
IEEE
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
117
click to vote
APL
1998
ACM
15 years 8 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
110
click to vote
AAAI
2007
15 years 6 months ago
2007
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
164
click to vote
HEURISTICS
1998
15 years 3 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
141
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Determining the provenance of data, i.e. the process that led to that data, is vital in many disciplines. For example, in science, the process that produced a given result must be...