The Experts below are selected from a list of 120 Experts worldwide ranked by ideXlab platform
Toby Walsh - One of the best experts on this subject based on the ideXlab platform.
-
IJCAI - Multiset ordering Constraints
2003Co-Authors: Alan M. Frisch, Ian Miguel, Zeynep Kiziltan, Brahim Hnich, Toby WalshAbstract:We identify a new and important global (or Nonbinary) Constraint which ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This Constraint is useful for a number of different applications including breaking symmetry and fuzzy Constraint satisfaction. We propose and implement a linear time algorithm for enforcing generalised arc-consistency on such a multiset ordering Constraint. Experimental results show considerable promise.
-
Multiset Ordering Constraints
2003Co-Authors: Alan Frisch, Ian Miguel, Zeynep Kiziltan, Brahim Hnich, Toby WalshAbstract:We identify a new and important global (or Nonbinary) Constraint which ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This Constraint is use- ful for a number of different applications including breaking symmetry and fuzzy Constraint satisfaction
-
Multiset Ordering Constraints
2003Co-Authors: Alan Frisch, Ian Miguel, Zeynep Kiziltan, Brahim Hnich, Toby WalshAbstract:We identify a new and important global (or Nonbinary) Constraint which ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This Constraint is useful for a number of different applications including breaking symmetry and fuzzy Constraint satisfaction. We propos
-
Multiset ordering Constraints
2003Co-Authors: Alan Frisch, Ian Miguel, Zeynep Kiziltan, Brahim Hnich, Toby WalshAbstract:We identify a new and important global (or Nonbinary) Constraint which ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This Constraint is useful for a number of different applications including breaking symmetry and fuzzy Constraint satisfaction. We propose and implement a linear time algorithm for enforcing generalised arc-consistency on such a multiset ordering Constraint. Experimental results show considerable promise.
-
Multiset ordering Constraints
2003Co-Authors: Alan Frisch, Ian Miguel, Zeynep Kiziltan, Brahim Hnich, Toby WalshAbstract:We identify a new and important global (or Nonbinary) Constraint. This Constraint ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This Constraint is useful for a number of different applications including breaking symmetry and fuzzy Constraint satisfaction. We propose and implement an efficient linear time algorithm for enforcing generalised arcconsistency on such a multiset ordering Constraint. Experimental results on several problem domains show considerable promise.
Zineb Habbas - One of the best experts on this subject based on the ideXlab platform.
-
Distributed backtracking algorithm based on tree decomposition over wireless sensor networks
Concurrency and Computation: Practice and Experience, 2011Co-Authors: Hacène Fouchal, Zineb HabbasAbstract:SUMMARY In this paper, we propose a methodological approach to solve distributed Nonbinary Constraint satisfaction problem (CSP) on wireless sensor networks (WSNs). A distributed CSP is a CSP in which variables and Constraints are distributed among multiple agents. On WSNs, it is usual to handle applications that need to solve distributed problems. Different real-world applications can be modeled as distributed CSPs, and numerous algorithms based on enumerative search have been proposed to solve them. The most cited one is distributed backtracking algorithm in which each variable is associated to each agent. This algorithm is known as fine-grained distributed algorithm. All the search efforts of this algorithm concerns the communication between agents that are very expensive. In addition, this approach is not realistic because, in general, an agent might control more than one variable. In this paper, we propose a generic methodology for developing coarse-grained backtracking algorithm. Mainly, a preprocess technique breaks a single large problem into a set of smaller connected ones. These semi-independent CSPs can be efficiently and concurrently solved and can cooperate to solve the whole problem. We illustrate the preprocess technique by the tree decomposition method for its good theoretical properties. The aim of our paper is to present an efficient approach to solve complex distributed CSPs over WSNs. Copyright © 2011 John Wiley & Sons, Ltd.
Habbas Zineb - One of the best experts on this subject based on the ideXlab platform.
-
Distributed backtracking algorithm based on tree decomposition over wireless sensor networks
'Wiley', 2013Co-Authors: Fouchal Hacene, Habbas ZinebAbstract:International audienceIn this paper, we propose a methodological approach to solve distributed Nonbinary Constraint satisfaction problem (CSP) on wireless sensor networks (WSNs). A distributed CSP is a CSP in which variables and Constraints are distributed among multiple agents. On WSNs, it is usual to handle applications that need to solve distributed problems. Different real-world applications can be modeled as distributed CSPs, and numerous algorithms based on enumerative search have been proposed to solve them. The most cited one is distributed backtracking algorithm in which each variable is associated to each agent. This algorithm is known as fine-grained distributed algorithm. All the search efforts of this algorithm concerns the communication between agents that are very expensive. In addition, this approach is not realistic because, in general, an agent might control more than one variable. In this paper, we propose a generic methodology for developing coarse-grained backtracking algorithm. Mainly, a preprocess technique breaks a single large problem into a set of smaller connected ones. These semi-independent CSPs can be efficiently and concurrently solved and can cooperate to solve the whole problem. We illustrate the preprocess technique by the tree decomposition method for its good theoretical properties. The aim of our paper is to present an efficient approach to solve complex distributed CSPs over WSNs. Copyright (c) 2011 John Wiley & Sons, Ltd
Abdul Sattar - One of the best experts on this subject based on the ideXlab platform.
-
Nonbinary Constraint satisfaction from the dual to the primal
The Florida AI Research Society, 2001Co-Authors: Sivakumar Nagarajan, Scott D Goodwin, Abdul SattarAbstract:Non binary Constraints have recently been studied quite extensively since they represent real life problems very naturally. Specifically, extensions to binary arc consistency into generalised arc consistency (GAC), and forward checking that incorporates a limited amount of GAC have been proposed, to handle non-binary Constraints directly. Enforcing arc consistency on the dual encoding has been shown to strictly dominate enforcing GAC on the primal encoding. More recently, modifications to dual arc consistency have extended these results to dual encodings that are based on the construction of compact Constraint coverings, that retain the completeness of the encodings, while using a fraction of the space. In this paper we present results that combine the enforcement of arc consistency in these covering based dual encodings, with performing forward checking based search in the primal encoding. We demonstrate how this new scheme can be shown to strictly dominate standard non-binary forward checking, while being able to efficiently enforce extremely high levels of consistency.
-
FLAIRS Conference - Nonbinary Constraint Satisfaction: From the Dual to the Primal
2001Co-Authors: Sivakumar Nagarajan, Scott D Goodwin, Abdul SattarAbstract:Non binary Constraints have recently been studied quite extensively since they represent real life problems very naturally. Specifically, extensions to binary arc consistency into generalised arc consistency (GAC), and forward checking that incorporates a limited amount of GAC have been proposed, to handle non-binary Constraints directly. Enforcing arc consistency on the dual encoding has been shown to strictly dominate enforcing GAC on the primal encoding. More recently, modifications to dual arc consistency have extended these results to dual encodings that are based on the construction of compact Constraint coverings, that retain the completeness of the encodings, while using a fraction of the space. In this paper we present results that combine the enforcement of arc consistency in these covering based dual encodings, with performing forward checking based search in the primal encoding. We demonstrate how this new scheme can be shown to strictly dominate standard non-binary forward checking, while being able to efficiently enforce extremely high levels of consistency.
Hacène Fouchal - One of the best experts on this subject based on the ideXlab platform.
-
Distributed backtracking algorithm based on tree decomposition over wireless sensor networks
Concurrency and Computation: Practice and Experience, 2011Co-Authors: Hacène Fouchal, Zineb HabbasAbstract:SUMMARY In this paper, we propose a methodological approach to solve distributed Nonbinary Constraint satisfaction problem (CSP) on wireless sensor networks (WSNs). A distributed CSP is a CSP in which variables and Constraints are distributed among multiple agents. On WSNs, it is usual to handle applications that need to solve distributed problems. Different real-world applications can be modeled as distributed CSPs, and numerous algorithms based on enumerative search have been proposed to solve them. The most cited one is distributed backtracking algorithm in which each variable is associated to each agent. This algorithm is known as fine-grained distributed algorithm. All the search efforts of this algorithm concerns the communication between agents that are very expensive. In addition, this approach is not realistic because, in general, an agent might control more than one variable. In this paper, we propose a generic methodology for developing coarse-grained backtracking algorithm. Mainly, a preprocess technique breaks a single large problem into a set of smaller connected ones. These semi-independent CSPs can be efficiently and concurrently solved and can cooperate to solve the whole problem. We illustrate the preprocess technique by the tree decomposition method for its good theoretical properties. The aim of our paper is to present an efficient approach to solve complex distributed CSPs over WSNs. Copyright © 2011 John Wiley & Sons, Ltd.