Sciweavers

5214 search results - page 297 / 1043
» The Online Specialization Problem
Sort
View
CP
2009
Springer
16 years 7 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
CP
2005
Springer
16 years 8 days ago
Sub-optimality Approximations
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
Russell Bent, Irit Katriel, Pascal Van Hentenryck
COCOON
1999
Springer
15 years 11 months ago
On Routing in Circulant Graphs
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...
EWSA
2006
Springer
15 years 10 months ago
Preserving Software Quality Characteristics from Requirements Analysis to Architectural Design
In this paper, we present a pattern-based software development method that preserves usability and security quality characteristics using a role-driven mapping of requirements anal...
Holger Schmidt, Ina Wentzlaff
NIPS
2007
15 years 8 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