1155 search results - page 154 / 231 » Continuous dynamic problem generators for evolutionary algor... |
140
Voted
HYBRID
2004
Springer
15 years 8 months ago
2004
Springer
We present a parameter inference algorithm for autonomous stochastic linear hybrid systems, which computes a maximum-likelihood model, given only a set of continuous output data of...
122
Voted
ALGORITHMICA
2006
15 years 2 months ago
2006
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
131
Voted
WWW
2007
ACM
16 years 3 months ago
2007
ACM
Several approaches to collaborative filtering have been studied but seldom have studies been reported for large (several million users and items) and dynamic (the underlying item ...
115
click to vote
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
114
Voted
SODA
2010
ACM
16 years 6 days ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...