1155 search results - page 216 / 231 » Continuous dynamic problem generators for evolutionary algor... |
101
Voted
KDD
2007
ACM
16 years 23 days ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
106
click to vote
INFOCOM
1999
IEEE
15 years 4 months ago
1999
IEEE
Abstract-The Internet today provides no support for privacy or authentication of multicast packets. However,an increasing number of applications will require secure multicast servi...
128
click to vote
UAI
2008
15 years 1 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
192
Voted
SIGMOD
2009
ACM
16 years 18 days ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
127
click to vote
BIBE
2008
IEEE
15 years 6 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...