2194 search results - page 54 / 439 » Improving HLRTA*( k ) |
ICANN
2009
Springer
14 years 2 months ago
2009
Springer
In the paper a new measure of distance between events/observations in the pattern space is proposed and experimentally evaluated with the use of k-NN classifier in the context of b...
IPCO
1993
14 years 10 days ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
PAMI
1998
13 years 10 months ago
1998
—Algorithmic enhancements are described that enable large computational reduction in mean square-error data clustering. These improvements are incorporated into a parallel data-c...
ERSHOV
2006
Springer
14 years 29 days ago
2006
Springer
We improve the decision procedure from [10] for the problem of generalized soundness of workflow nets. A workflow net is generalized sound iff every marking reachable from an initi...
CCCG
2008
14 years 14 days ago
2008
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...