Sciweavers

10666 search results - page 1792 / 2134
» Quantum programming languages
Sort
View
CP
2007
Springer
15 years 11 months ago
Strong Controllability of Disjunctive Temporal Problems with Uncertainty
The Disjunctive Temporal Problem with Uncertainty (DTPU) is an extension of the Disjunctive Temporal Problem (DTP) that accounts for events not under the control of the executing a...
Bart Peintner, Kristen Brent Venable, Neil Yorke-S...
CP
2007
Springer
15 years 11 months ago
Constraint Symmetry for the Soft CSP
We introduce a definition of constraint symmetry for soft CSPs, based on the definition of constraint symmetry for classical CSPs. We show that the constraint symmetry group of a...
Barbara M. Smith, Stefano Bistarelli, Barry O'Sull...
CP
2007
Springer
15 years 11 months ago
Dealing with Incomplete Preferences in Soft Constraint Problems
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possibl...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
CP
2007
Springer
15 years 11 months ago
Solution Counting Algorithms for Constraint-Centered Search Heuristics
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
Alessandro Zanarini, Gilles Pesant
CP
2007
Springer
15 years 11 months ago
Boosting Probabilistic Choice Operators
Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent...
Matthieu Petit, Arnaud Gotlieb
« Prev « First page 1792 / 2134 Last » Next »