Sciweavers

14161 search results - page 257 / 2833
» On generalized middle-level problem
Sort
View
DSS
2007
112views more  DSS 2007»
15 years 6 months ago
Service-based P2P overlay network for collaborative problem solving
This paper describes a service-based P2P overlay network architecture to support a collaborative environment for solving complex business processes over the network. In the propos...
Sanjay Goel, Shashishekara S. Talya, Michael W. So...
PR
2008
93views more  PR 2008»
15 years 6 months ago
Genetic algorithm-based feature set partitioning for classification problems
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...
Lior Rokach
JMLR
2010
125views more  JMLR 2010»
15 years 1 months ago
Regret Bounds for Gaussian Process Bandit Problems
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
Steffen Grünewälder, Jean-Yves Audibert,...
FOCS
2008
IEEE
15 years 7 months ago
Minimizing Movement in Mobile Facility Location Problems
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
Zachary Friggstad, Mohammad R. Salavatipour
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 9 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar