(Enter summary)
Abstract: Nowadays, many real problems can be modeled as Constraint
Satisfaction Problems (CSPs). Generally, these
problems are solved by search algorithms, which require
an order in which variables and values should be
considered. Choosing the right order of variables and
values can noticeably improve the e#ciency of constraint
satisfaction. The order in which constraints
are studied can also improve e#ciency, particularly in
problems with non-binary constraints. (Update)
Cited by: More
Constrainedness and Redundancy by Constraint Ordering - Salido, Barber
(Correct)
Exploiting the Constrainedness in Constraint Satisfaction.. - Salido, Barber
(Correct)
Active bibliography (related documents): More All
0.4: Distributing Constraints by Sampling in Non-binary CSPs - Salido, Giret, Barber (2003)
(Correct)
0.2: Distributed Problem Solving Without Communication - An.. - Liu, Jin, Han (2002)
(Correct)
0.2: Multiagent SAT (MASSAT): Autonomous Pattern Search in.. - Jin, Liu
(Correct)
Similar documents based on text: More All
0.6: Distributing Constraints by Sampling in Non-Binary CSPs - Salido, Giret, Barber (2003)
(Correct)
0.5: Distributed Non-binary Constraints - Miguel Salido And
(Correct)
0.4: Distributed Hard and Soft Non-binary Constraints: An Any-Time .. - Salido, Barber
(Correct)
Related documents from co-citation: More All
3: Understanding line drawings of scenes with shadows
- Waltz - 1975
3: Network-based heuristics for constraint-satisfaction problems (context) - Dechter, Pearl - 1988
3: Ordering heuristics for arc consistency algorithms
- Wallace, Freuder - 1992
BibTeX entry: (Update)
M.A. Salido, A. Giret, and F. Barber, `Distributing Constraints by Sampling in Non-Binary CSPs', In IJCAI Workshop on Distributing Constraint Reasoning,79-- 87, (2003). http://citeseer.ist.psu.edu/article/salido03distributing.html More
@misc{ salido03distributing,
author = "M. Salido and A. Giret and F. Barber",
title = "Distributing Constraints by Sampling in Non-Binary CSPs",
text = "M.A. Salido, A. Giret, and F. Barber, `Distributing Constraints by Sampling
in Non-Binary CSPs', In IJCAI Workshop on Distributing Constraint Reasoning,79--
87, (2003).",
year = "2003",
url = "citeseer.ist.psu.edu/article/salido03distributing.html" }
Citations (may not include all citations):
191
Algorithms for constraint satisfaction problems: a survey
- Kumar - 1992
83
The distributed constraint satisfaction problem: Formalizati..
- Yokoo, Durfee et al. - 1998
39
Experimental evaluation of preprocessing algorithms for cons.. (context) - Dechter, Meiri - 1994
35
Dual viewpoint heuristic for binary constraint satisfaction .. (context) - Geelen - 1992
35
Look-ahead value orderings for constraint satisfaction probl..
- Frost, Dechter - 1995
33
Asynchronous weak-commitment search for solving distributed .. (context) - Yokoo - 1995
21
Variable and value ordering heuristics for activity-based jo.. (context) - Sadeh, Fox - 1990
15
Constraint programming: In pursuit of the holy grail
- Bartak - 1999
14
cient condition for backtrackfree search (context) - Freuder - 1982
4
Autonomous agents and multi-agent systems: Explorations in l.. (context) - Liu - 2001
3
Increasing tree e#- ciency for constraint satisfaction probl.. (context) - Haralick - 1980
1
London and San Diego (context) - San, Press et al. - 1995
1
Constraint handling rules: Applications and extensions: Invi..
- Abdennadher - 1999
Documents on the same site (http://www.dsic.upv.es/~msalido/publications.htm): More
A Topological Model Based on Railway Capacity to.. - Salido, Barber.. (2004)
(Correct)
A Decision Support System (DSS) for the Railway.. - Ingolotti, Tormos..
(Correct)
Intelligent Train Scheduling on a High-Loaded Railway.. - Lova, Tormos, Barber, ..
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC