The SCEAS System
| |||||||

## Search the dblp DataBase
Kostas Stergiou:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Kostas Stergiou, Manolis Koubarakis
**Backtracking Algorithms for Disjunctions of Temporal Constraints.**[Citation Graph (1, 0)][DBLP] AAAI/IAAI, 1998, pp:248-253 [Conf] - Barbara M. Smith, Kostas Stergiou, Toby Walsh
**Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems.**[Citation Graph (0, 0)][DBLP] AAAI/IAAI, 2000, pp:182-187 [Conf] - Kostas Stergiou, Toby Walsh
**Encodings of Non-Binary Constraint Satisfaction Problems.**[Citation Graph (0, 0)][DBLP] AAAI/IAAI, 1999, pp:163-168 [Conf] - Konstantinos Kotis, George A. Vouros, Kostas Stergiou
**Capturing Semantics Towards Automatic Coordination of Domain Ontologies.**[Citation Graph (0, 0)][DBLP] AIMSA, 2004, pp:22-32 [Conf] - Ian P. Gent, Kostas Stergiou, Toby Walsh
**Decomposable Constraints.**[Citation Graph (0, 0)][DBLP] New Trends in Constraints, 1999, pp:134-149 [Conf] - Thanasis Balafoutis, Kostas Stergiou
**Algorithms for Stochastic CSPs.**[Citation Graph (0, 0)][DBLP] CP, 2006, pp:44-58 [Conf] - Yannis Dimopoulos, Kostas Stergiou
**Propagation in CSP and SAT.**[Citation Graph (0, 0)][DBLP] CP, 2006, pp:137-151 [Conf] - Nikos Mamoulis, Kostas Stergiou
**Solving Non-binary CSPs Using the Hidden Variable Encoding.**[Citation Graph (0, 0)][DBLP] CP, 2001, pp:168-182 [Conf] - Nikos Mamoulis, Kostas Stergiou
**Constraint Satisfaction in Semi-structured Data Graphs.**[Citation Graph (0, 0)][DBLP] CP, 2004, pp:393-407 [Conf] - Nikos Mamoulis, Kostas Stergiou
**Algorithms for Quantified Constraint Satisfaction Problems.**[Citation Graph (0, 0)][DBLP] CP, 2004, pp:752-756 [Conf] - Patrick Prosser, Kostas Stergiou, Toby Walsh
**Singleton Consistencies.**[Citation Graph (0, 0)][DBLP] CP, 2000, pp:353-368 [Conf] - Kostas Stergiou
**Repair-Based Methods for Quantified CSPs.**[Citation Graph (0, 0)][DBLP] CP, 2005, pp:652-666 [Conf] - Kostas Stergiou, Toby Walsh
**Inverse Consistencies for Non-Binary Constraints.**[Citation Graph (0, 0)][DBLP] ECAI, 2006, pp:153-157 [Conf] - Ian P. Gent, Peter Nightingale, Kostas Stergiou
**QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems.**[Citation Graph (0, 0)][DBLP] IJCAI, 2005, pp:138-143 [Conf] - Kostas Stergiou, Toby Walsh
**The Difference All-Difference Makes.**[Citation Graph (0, 0)][DBLP] IJCAI, 1999, pp:414-419 [Conf] - Nikos Samaras, Kostas Stergiou
**Arc Consistency in Binary Encodings of Non-binary CSPs: Theoretical and Experimental Evaluation.**[Citation Graph (0, 0)][DBLP] SETN, 2004, pp:352-361 [Conf] - Kostas Stergiou
**On Algorithms for Decomposable Constraints.**[Citation Graph (0, 0)][DBLP] SETN, 2002, pp:65-71 [Conf] - Ian P. Gent, Kostas Stergiou, Toby Walsh
**Decomposable constraints.**[Citation Graph (0, 0)][DBLP] Artif. Intell., 2000, v:123, n:1-2, pp:133-156 [Journal] - Kostas Stergiou, Manolis Koubarakis
**Backtracking algorithms for disjunctions of temporal constraints.**[Citation Graph (0, 0)][DBLP] Artif. Intell., 2000, v:120, n:1, pp:81-117 [Journal] - Paraskevi Raftopoulou, Manolis Koubarakis, Kostas Stergiou, Peter Triantafillou
**Fair Resource Allocation in a Simple Multi-agent Setting: Search Algorithms and Experimental Evaluation.**[Citation Graph (0, 0)][DBLP] International Journal on Artificial Intelligence Tools, 2005, v:14, n:6, pp:887-900 [Journal] - Fahiem Bacchus, Kostas Stergiou
**Solution Directed Backjumping for QCSP.**[Citation Graph (0, 0)][DBLP] CP, 2007, pp:148-163 [Conf] - Kostas Stergiou, Nikos Samaras
**Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results.**[Citation Graph (0, 0)][DBLP] J. Artif. Intell. Res. (JAIR), 2005, v:24, n:, pp:641-684 [Journal] **Overlay networks for task allocation and coordination in dynamic large-scale networks of cooperative agents.**[Citation Graph (, )][DBLP]**Learning How to Propagate Using Random Probing.**[Citation Graph (, )][DBLP]**Heuristics for Dynamically Adapting Propagation.**[Citation Graph (, )][DBLP]**Adaptive Branching for Constraint Satisfaction Problems.**[Citation Graph (, )][DBLP]**Strong Inverse Consistencies for Non-Binary CSPs.**[Citation Graph (, )][DBLP]**Conflict Directed Variable Selection Strategies for Constraint Satisfaction Problems.**[Citation Graph (, )][DBLP]**A Study of SAT-Based Branching Heuristics for the CSP.**[Citation Graph (, )][DBLP]**Domain filtering consistencies for non-binary constraints.**[Citation Graph (, )][DBLP]**Solving quantified constraint satisfaction problems.**[Citation Graph (, )][DBLP]**Heuristics for dynamically adapting propagation in constraint satisfaction problems.**[Citation Graph (, )][DBLP]**Introduction to the special issue on quantified CSPs and QBF.**[Citation Graph (, )][DBLP]**Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs**[Citation Graph (, )][DBLP]**Adaptive Branching for Constraint Satisfaction Problems**[Citation Graph (, )][DBLP]**Improving the Performance of maxRPC**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |