Sciweavers

45 search results - page 6 / 9
» Random Constraint Satisfaction: A More Accurate Picture
Sort
View
77
Voted
TIP
2010
94views more  TIP 2010»
14 years 4 months ago
User-Friendly Interactive Image Segmentation Through Unified Combinatorial User Inputs
One weakness in the existing interactive image segmentation algorithms is the lack of more intelligent ways to understand the intention of user inputs. In this paper, we advocate t...
Wenxian Yang, Jianfei Cai, Jianmin Zheng, Jiebo Lu...
AAAI
2006
14 years 11 months ago
The Impact of Balancing on Problem Hardness in a Highly Structured Domain
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
Carlos Ansótegui, Ramón Béjar...
IAT
2006
IEEE
15 years 3 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler
FLAIRS
2004
14 years 11 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
RSS
2007
151views Robotics» more  RSS 2007»
14 years 11 months ago
An Implicit Time-Stepping Method for Multibody Systems with Intermittent Contact
— In this paper we present an implicit time-stepping scheme for multibody systems with intermittent contact by incorporating the contact constraints as a set of complementarity a...
Nilanjan Chakraborty, Stephen Berard, Srinivas Ake...