Konstantinos Chatzikokolakis, George Boukeas, Panagiotis Stamatopoulos  Home/Search
Context
Related
| cgi.di.uoa.gr/~tak...etn04crsearch.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cgi.di.uoa.gr/~takis/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables are instantiated. If the current partial assignment is proved to be inconsistent, it is then necessary to backtrack and perform alternative instantiations. On the other hand, reparative methods iteratively repair an inconsistent complete assignment until it becomes consistent. In this research, we investigate an approach which... (Update)
Active bibliography (related documents): More All
2.4: Construction and Repair: - Hybrid Approach To (Correct)
0.9: Local Search With Constraint Propagation and Conflict-Based.. - Jussien, Lhomme (2002) (Correct)
0.6: Explanation-Based Repair Techniques for Constraint Programming - Jussien, Debruyne (Correct)
Similar documents based on text: More All
0.4: Intelligent System for Aerial Image Retrieval and.. - Gasteratos.. (2004) (Correct)
0.3: Measures of Intrinsic Hardness for Constraint.. - Boukeas.. (2004) (Correct)
0.3: G.A. Vouros and T. Panayiotopoulos (Eds.): SETN.. - Springer-Verlag.. (Correct)
BibTeX entry: (Update)
@inproceedings{ chatzi04cr,
author = "Konstantinos Chatzikokolakis and George Boukeas and Panagiotis Stamatopoulos",
title = "{C}onstruction and {R}epair: {A} {H}ybrid {A}pproach to {S}earch in {CSP}s",
booktitle = "3rd Hellenic Conference on Artificial Intelligence, SETN 2004",
publisher = "Lecture Notes in Artificial Intelligence, Springer-Verlag",
volume = "3025",
pages = "342-351",
editor = "George Vouros and Panagiotopoulos Themistoklis",
year = 2004,
url = "citeseer.ist.psu.edu/chatzikokolakis04construction.html" }
Citations (may not include all citations):210 Minimizing conflicts: a heuristic repair method for constrai.. - Minton, Johnston et al. - 1992
64 Benchmarks for basic scheduling problems - Taillard - 1993
62 Open shop scheduling to minimize finish time (context) - Gonzalez, Sahni - 1976
18 Combining local search and look-ahead for scheduling and con.. (context) - Schaerf - 1997
16 Combining local search and backtracking techniques for const.. (context) - Zhang, Zhang - 1996
15 Local search with constraint propagation and conflictbased h.. - Jussien, Lhomme - 2002
12 A branch-and-bound algorithm for the open-shop problem (context) - Brucker, Hurink et al. - 1997
7 A tabu search algorithm for the open shop problem (context) - Alcaide, Sicilia et al. - 1997
7 A tabu search algorithm for the open shop scheduling problem (context) - Liaw - 1999
7 Using intelligent backtracking to improve branchand -bound m.. - Gueret, Jussien et al.
6 Competitive genetic algorithms for the open shop scheduling .. (context) - Prins - 2000
5 Combining the scalability of local search with the pruning t.. - Prestwich - 2002
3 A new lower bound for the open-shop problem (context) - Gueret, Prins - 1999
2 Combining local search and constraint propagation to find a .. - Roos, Ran - 2000
2 Integrating local-search advice into refinement search (context) - Nareyek, Smith et al. - 2003
Documents on the same site (http://cgi.di.uoa.gr/~takis/): More
Crew Assignment by Constraint Logic Programming - Christodoulou, Stamatopoulos (Correct)
Combinatorial Optimization through Statistical.. - Telelis, Stamatopoulos (2001) (Correct)
Heuristic Backbone Sampling for Maximum Satisfiablity - Telelis, Stamatopoulos (2002) (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