Sciweavers

3894 search results - page 478 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ICTAI
1997
IEEE
15 years 8 months ago
GA-Based Performance Analysis of Network Protocols
This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is abl...
Mario Baldi, Fulvio Corno, Maurizio Rebaudengo, Gi...
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
15 years 8 months ago
Support vector regression for classifier prediction
In this paper we introduce XCSF with support vector prediction: the problem of learning the prediction function is solved as a support vector regression problem and each classifie...
Daniele Loiacono, Andrea Marelli, Pier Luca Lanzi
ATAL
2008
Springer
15 years 6 months ago
Sequential decision making in repeated coalition formation under uncertainty
The problem of coalition formation when agents are uncertain about the types or capabilities of their potential partners is a critical one. In [3] a Bayesian reinforcement learnin...
Georgios Chalkiadakis, Craig Boutilier
ALENEX
2010
117views Algorithms» more  ALENEX 2010»
15 years 6 months ago
Untangling the Braid: Finding Outliers in a Set of Streams
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
Chiranjeeb Buragohain, Luca Foschini, Subhash Suri
NIPS
2007
15 years 5 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland