Sciweavers

136 search results - page 14 / 28
» The Satisfiability Problem for Probabilistic Ordered Branchi...
Sort
View
CSCLP
2006
Springer
13 years 11 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
ACL
2004
13 years 9 months ago
Aligning words using matrix factorisation
Aligning words from sentences which are mutual translations is an important problem in different settings, such as bilingual terminology extraction, Machine Translation, or projec...
Cyril Goutte, Kenji Yamada, Éric Gaussier
CAV
2004
Springer
151views Hardware» more  CAV 2004»
13 years 11 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
ECAI
2010
Springer
13 years 8 months ago
Constraint-Based Controller Synthesis in Non-Deterministic and Partially Observable Domains
Controller synthesis consists in automatically building controllers taking as inputs observation data and returning outputs guaranteeing that the controlled system satisfies some d...
Cédric Pralet, Gérard Verfaillie, Mi...
CP
2007
Springer
14 years 1 months ago
Solving the Salinity Control Problem in a Potable Water System
Salinity is the relative concentration of salts in water. In a city of southern China, the local water supply company pumps water from a nearby river for potable use. During the wi...
Chiu Wo Choi, Jimmy Ho-Man Lee