144 search results - page 9 / 29 » Running time and program size for self-assembled squares |
DAC
1995
ACM
13 years 11 months ago
1995
ACM
—Embedded computer systems are characterized by the presence of a processor running application-specific dedicated software. A large number of these systems must satisfy real-ti...
CPM
1997
Springer
13 years 11 months ago
1997
Springer
We show an ecient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operati...
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
ICALP
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
SEAL
1998
Springer
13 years 11 months ago
1998
Springer
Genetic programming evolves Lisp-like programs rather than fixed size linear strings. This representational power combined with generality makes genetic programming an interesting ...