4112 search results - page 267 / 823 » Efficient Algorithms for the Spoonerism Problem |
184
click to vote
APWEB
2005
Springer
16 years 8 days ago
2005
Springer
The dramatic growth in the number and size of on-line information sources has fueled increasing research interest in the incremental subspace learning problem. In this paper, we pr...
166
click to vote
TCS
2008
15 years 6 months ago
2008
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
169
click to vote
IPL
2002
15 years 6 months ago
2002
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
175
click to vote
JUCS
2002
15 years 6 months ago
2002
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
155
Voted
ICML
2000
IEEE
16 years 7 months ago
2000
IEEE
We explore combining reinforcement learning with a hand-crafted local controller in a manner suggested by the chaotic control algorithm of Vincent, Schmitt and Vincent (1994). A c...