Sciweavers

717 search results - page 24 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
71 views 150 votes 15 years 11 months ago  CPAIOR 2007»
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
247 views 138 votes 16 years 3 days ago  ACG 2009»
Abstract. Kakuro consists in filling a grid with integers that sum up to predefined values. Sums are predefined for each row and column and all integers have to be different in ...
105 views 138 votes 15 years 10 months ago  IDEAL 2003»
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
138 views 162 votes 15 years 11 months ago  IJCNN 2006»
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
164 views 171 votes 15 years 8 months ago  CP 2009»
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
94 views 130 votes 15 years 11 months ago  ICTAI 2007»
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
128 views 176 votes 15 years 5 months ago  AI 2005»
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
113 views 160 votes 15 years 11 months ago  QSHINE 2005»
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
183 views 215 votes 16 years 5 months ago  SIGMOD 2007»
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...
101 views 167 votes 15 years 10 months ago  ICTAI 2002»
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...