Sciweavers

1012 search results - page 93 / 203
» Process Algebra with Backtracking
Sort
View
CP
2005
Springer
14 years 1 months ago
Probabilistic Arc Consistency
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
Deepak Mehta, Marc R. C. van Dongen
ECAI
2004
Springer
14 years 1 months ago
Using Constraints with Memory to Implement Variable Elimination
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
Martí Sánchez, Pedro Meseguer, Javie...
SAT
2004
Springer
97views Hardware» more  SAT 2004»
14 years 1 months ago
Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization
Linear Pseudo-Boolean constraints offer a much more compact formalism to express significant boolean problems in several areas, ranging from Artificial Intelligence to Electroni...
Vasco M. Manquinho, João P. Marques Silva
ICRA
2002
IEEE
91views Robotics» more  ICRA 2002»
14 years 27 days ago
Tactile Tracking of Arteries in Robotic Surgery
Locating arteries hidden beneath superficial tissue can be a difficult task in minimally invasive surgery. This paper reports the development of a system that finds the paths of a...
Ryan A. Beasley, Robert D. Howe
PPDP
2001
Springer
14 years 12 days ago
An Implementation of Narrowing Strategies
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...
Sergio Antoy, Michael Hanus, Bart Massey, Frank St...