Sciweavers

4131 search results - page 202 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
126
Voted
CP
2008
Springer
15 years 5 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
133
Voted
DCOSS
2008
Springer
15 years 5 months ago
Frugal Sensor Assignment
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro...
135
Voted
WINE
2009
Springer
172views Economy» more  WINE 2009»
15 years 10 months ago
An Online Multi-unit Auction with Improved Competitive Ratio
We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, ...
Sourav Chakraborty, Nikhil R. Devanur
112
Voted
NIPS
2007
15 years 5 months ago
Bundle Methods for Machine Learning
We present a globally convergent method for regularized risk minimization problems. Our method applies to Support Vector estimation, regression, Gaussian Processes, and any other ...
Alex J. Smola, S. V. N. Vishwanathan, Quoc V. Le

Book
357views
17 years 1 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang