7522 search results - page 332 / 1505 » Spacing memetic algorithms |
191
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
161
click to vote
PAMI
1998
15 years 6 months ago
1998
—Visualization has proven to be a powerful and widely-applicable tool for the analysis and interpretation of multivariate data. Most visualization algorithms aim to find a projec...
222
click to vote
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
174
click to vote
DAGM
2005
Springer
16 years 10 days ago
2005
Springer
The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing devi...
184
click to vote
RTSS
1996
IEEE
15 years 11 months ago
1996
IEEE
We propose a method for reducing the number of clocks of a timed automaton by combining two algorithms. The first one consists in detecting active clocks, that is, those clocks wh...