8825 search results - page 123 / 1765 » All for one or one for all |
118
click to vote
PARA
2004
Springer
15 years 6 months ago
2004
Springer
It is known that in general, statistical analysis of interval data is an NP-hard problem: even computing the variance of interval data is, in general, NP-hard. Until now, only one ...
101
click to vote
ICDM
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper we study the problem of classifying chemical compound datasets. We present a sub-structure-based classification algorithm that decouples the sub-structure discovery...
126
click to vote
CAEPIA
2003
Springer
15 years 6 months ago
2003
Springer
One of the most important tasks for determining association rules consists of calculating all the maximal frequent itemsets. Specifically, some methods to obtain these itemsets hav...
116
click to vote
ISAAC
2003
Springer
15 years 6 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
HICSS
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we define a continuum of modeling styles, ranging from collections of very simple agents on one end to collections of very complex agents at the other end, and a s...