Sciweavers

717 search results - page 40 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
129 views 100 votes 15 years 2 months ago  HIS 2004»
This paper proposes the methods to solve the constraint satisfaction problems (CSPs) using Q'tron neural networks (NNs). A Q'tron NN is local-minima free if it is built ...
97 views 107 votes 15 years 5 months ago  CP 1998»
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
99 views 84 votes 15 years 5 months ago  CP 2006»
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
98 views 141 votes 15 years 7 months ago  CP 2007»
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
136 views 102 votes 15 years 7 months ago  ECAI 2004»
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...
116 views 98 votes 15 years 5 months ago  CP 1995»
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
141 views 114 votes 15 years 8 months ago  AIMSA 2008»
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
113 views 127 votes 15 years 2 months ago  AAAI 2006»
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
101 views 104 votes 15 years 6 months ago  IEAAIE 2001»
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
162 views 136 votes 15 years 3 months ago  AUSAI 2008»
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...