988 search results - page 111 / 198 » Pseudo-Genetic Algorithmic Composition |
ECCC
2007
14 years 10 months ago
2007
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
115
click to vote
VG
2003
14 years 11 months ago
2003
The shear-warp volume rendering algorithm is one of the fastest algorithms for volume rendering, but it achieves this rendering speed only by sacrificing interpolation between th...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
ANTSW
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Mobile ad hoc networks are a class of highly dynamic networks. In previous work, we developed a new routing algorithm, called AntHocNet, for these challenging network env...
TKDE
2008
14 years 10 months ago
2008
Clustering is inherently a difficult task and is made even more difficult when the selection of relevant features is also an issue. In this paper, we propose an approach for simult...