Sciweavers

942 search results - page 142 / 189
» Distance Constraint Satisfaction Problems
Sort
View
CP
2006
Springer
15 years 7 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
ICST
2010
IEEE
15 years 1 months ago
Satisfying Test Preconditions through Guided Object Selection
—A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditi...
Yi Wei, Serge Gebhardt, Bertrand Meyer, Manuel Ori...
CPAIOR
2009
Springer
15 years 10 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
ICRA
2009
IEEE
178views Robotics» more  ICRA 2009»
15 years 1 months ago
A riemannian-geometry approach for dynamics and control of object manipulation under constraints
A Riemannian-geometry approach for control and stabilization of dynamics of object manipulation under holonomic or non-holonomic (but Pfaffian) constraints is presented. First, pos...
Suguru Arimoto, Morio Yoshida, Masahiro Sekimoto, ...
174
Voted
CIMCA
2006
IEEE
15 years 9 months ago
A Knowledge-based Security Policy Framework for Business Process Management
Business Process Management (BPM) is often a key component of the business change. Business rules, whether embedded within BPM or on their own, have begun playing an ever-increasi...
Dong Huang, Yi Yang, Jacques Calmet