Sciweavers

5595 search results - page 829 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
AAAI
2007
15 years 9 months ago
Computational Complexity of Weighted Threshold Games
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its w...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
DIS
2008
Springer
15 years 8 months ago
Active Learning for High Throughput Screening
Abstract. An important task in many scientific and engineering disciplines is to set up experiments with the goal of finding the best instances (substances, compositions, designs) ...
Kurt De Grave, Jan Ramon, Luc De Raedt
CATS
2007
15 years 8 months ago
Some Structural and Geometric Properties of Two-Connected Steiner Networks
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
ICMLA
2008
15 years 8 months ago
A Bayesian Approach to Switching Linear Gaussian State-Space Models for Unsupervised Time-Series Segmentation
Time-series segmentation in the fully unsupervised scenario in which the number of segment-types is a priori unknown is a fundamental problem in many applications. We propose a Ba...
Silvia Chiappa
188
Voted
ICMLA
2008
15 years 8 months ago
Basis Function Construction in Reinforcement Learning Using Cascade-Correlation Learning Architecture
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
Sertan Girgin, Philippe Preux