Sciweavers

1160 search results - page 35 / 232
» Applying Constraint Solving to the Management of Distributed...
Sort
View
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
15 years 8 days ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
CISS
2008
IEEE
15 years 8 months ago
Distributed algorithm and reversible network
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
Shreevatsa Rajagopalan, Devavrat Shah
DSOM
2004
Springer
15 years 7 months ago
Using Object-Oriented Constraint Satisfaction for Automated Configuration Generation
In this paper, we describe an approach for automatically generating configurations for complex applications. Automated generation of system co nfigurations is required to allow lar...
Tim Hinrichs, Nathaniel Love, Charles J. Petrie, L...
AAAI
2010
15 years 3 months ago
Collaborative Expert Portfolio Management
We consider the task of assigning experts from a portfolio of specialists in order to solve a set of tasks. We apply a Bayesian model which combines collaborative filtering with a...
David H. Stern, Horst Samulowitz, Ralf Herbrich, T...
CP
1995
Springer
15 years 5 months ago
Partial Constraint Satisfaction
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
Eugene C. Freuder, Richard J. Wallace