Richard J. Wallace

2015

Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings.

[BibT_eX]

[DOI]

Artif. Intell. Rev., 2015

SAC and neighbourhood SAC.

[BibT_eX]

[DOI]

AI Commun., 2015

Light-Weight versus Heavy-Weight Algorithms for SAC and Neighbourhood SAC.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Florida Artificial Intelligence Research Society Conference, 2015

2014

Robustness and Stability in Constraint Programming under Dynamism and Uncertainty.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2014

Extrapolating from Limited Uncertain Information to Obtain Robust Solutions for Large-Scale Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

A New Approach to Optimization with Life Cycle Assessment: Combining Optimization with Detailed Process Simulation.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014

Robustness and Stability in Constraint Programming under Dynamism and Uncertainty - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

Modeling Robustness in CSPs as Weighted CSPs.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012

An Algorithm for Finding Robust and Stable Solutions for Constraint Satisfaction Problems with Discrete and Ordered Domains.

[BibT_eX]

[DOI]

Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

2010

Lexicographically-ordered constraint satisfaction problems.

[BibT_eX]

[DOI]

Constraints An Int. J., 2010

2009

Conditional lexicographic orders in constraint satisfaction problems.

[BibT_eX]

[DOI]

Nic Wilson

Ann. Oper. Res., 2009

Towards a novel early warning service for state agencies: A feasibility study.

[BibT_eX]

[DOI]

Proceedings of the Information Technologies in Environmental Engineering, 2009

Dynamic Constraint Satisfaction Problems: Relations among Search Strategies, Solution Sets and Algorithm Performance.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Constraints, 2009

2008

Experimental studies of variable selection strategies based on constraint weights.

[BibT_eX]

[DOI]

J. Algorithms, 2008

Determining the Principles Underlying Performance Variation in CSP Heuristics.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2008

Solving Dynamic Constraint Satisfaction Problems by Identifying Stable Features.

[BibT_eX]

[DOI]

Proceedings of the 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2008

2007

Maintaining constraint-based applications.

[BibT_eX]

[DOI]

Tomas Eric Nordlander

Proceedings of the 4th International Conference on Knowledge Capture (K-CAP 2007), 2007

Determining the Basis for Performance Variations in CSP Heuristics.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

Learning to Identify Global Bottlenecks in Constraint Satisfaction Search.

[BibT_eX]

[DOI]

Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, 2007

Sampling Strategies and Variable Selection in Weighted Degree Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2007

Ontologies as Contexts for Constraint-based Reasoning.

[BibT_eX]

[DOI]

Tomas Eric Nordlander

Ioannis M. Dokas

Proceedings of the International Workshop on Contexts and Ontologies: Representation and Reasoning (C&O:RR) Collocated with the 6th International and Interdisciplinary Conference on Modelling and Using Context (CONTEXT-2007), 2007

Branching Rules for Satisfiability Analysed with Factor Analysis.

[BibT_eX]

[DOI]

Stuart Bain

Proceedings of the AI 2007: Advances in Artificial Intelligence, 2007

2006

Heuristic Policy Analysis and Efficiency Assessment in Constraint Satisfaction Search.

[BibT_eX]

[DOI]

Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006

Finding Crucial Subproblems to Focus Global Search.

[BibT_eX]

[DOI]

Susan L. Epstein

Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), 2006

2005

Supporting dispatchability in schedules with consumable resources.

[BibT_eX]

[DOI]

J. Sched., 2005

Learning to Support Constraint Programmers.

[BibT_eX]

[DOI]

Susan L. Epstein

Comput. Intell., 2005

Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving.

[BibT_eX]

[DOI]

Artif. Intell., 2005

Analysis of Heuristic Synergies.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Constraints, 2005

2004

Multi-Agent Constraint Systems with Preferences: Efficiency, Solution Quality, and Privacy Loss.

[BibT_eX]

[DOI]

Comput. Intell., 2004

Possibilistic Reasoning and Privacy/Efficiency Tradeoffs in Multi-agent Systems.

[BibT_eX]

[DOI]

Marius Minca

Proceedings of the MICAI 2004: Advances in Artificial Intelligence, 2004

Using Privacy Loss to Guide Decisions During Distributed CSP Search.

[BibT_eX]

[DOI]

Marius-Calin Silaghi

Proceedings of the Seventeenth International Florida Artificial Intelligence Research Society Conference, 2004

Constraint Processing with Reactive Agents.

[BibT_eX]

[DOI]

Georg Ringwelski

Proceedings of the Seventeenth International Florida Artificial Intelligence Research Society Conference, 2004

Failing First: An Update.

[BibT_eX]

J. Christopher Beck

Patrick Prosser

Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Trying Again to Fail-First.

[BibT_eX]

[DOI]

J. Christopher Beck

Patrick Prosser

Proceedings of the Recent Advances in Constraints, 2004

A Web-Based Meeting Scheduling Solver With Privacy Guarantees, Without Trusted Servers.

[BibT_eX]

[DOI]

Marius-Calin Silaghi

Vaibhav Rajeshirke

Proceedings of the Principles and Practice of Constraint Programming, 2004

Variable Ordering Heuristics Show Promise.

[BibT_eX]

[DOI]

J. Christopher Beck

Patrick Prosser

Proceedings of the Principles and Practice of Constraint Programming, 2004

2003

The Goldilocks problem.

[BibT_eX]

[DOI]

Tudor Hulubei

Artif. Intell. Eng. Des. Anal. Manuf., 2003

Greater Efficiency for Conditional Constraint Satisfaction.

[BibT_eX]

[DOI]

Mihaela Sabin

Proceedings of the Principles and Practice of Constraint Programming, 2003

2002

Suggestion Strategies for Constraint-Based Matchmaker Agents.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2002

Representing Possibilities in Relation to Constraints and Agents.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

The Adaptive Constraint Engine.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2002

Computing Explanations and Implications in Preference-Based Configurators.

[BibT_eX]

[DOI]

Chavalit Likitvivatanavong

Manuela Moretti

Francesca Rossi

Proceedings of the Recent Advances in Constraints, 2002

2001

Deriving Explanations and Implications for Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Chavalit Likitvivatanavong

Proceedings of the Principles and Practice of Constraint Programming, 2001

2000

Dispatchability Conditions for Schedules with Consumable Resources.

[BibT_eX]

Proceedings of the ECAI 2000, 2000

Dispatchable Execution of Schedules Involving Consumable Resources.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 2000

1998

Constraints and Agents Confronting Ignorance.

[BibT_eX]

[DOI]

Peggy S. Eaton

AI Mag., 1998

Introduction to DIMACS workshop on Constraint Programming and Large Scale Discrete Optimization.

[BibT_eX]

[DOI]

Proceedings of the Constraint Programming and Large Scale Discrete Optimization, 1998

Stable Solutions for Dynamic Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 1998

1996

Anytime Algorithms for Constraint Satisfaction and SAT Problems.

[BibT_eX]

[DOI]

SIGART Bull., 1996

Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

Enhancing Maximum Satisfiablility Algorithms with Pure Literal Strategies.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 1996

Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995

Generalizing Inconsistency Learning for Constraint Satisfaction.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Heuristic Methods for Over-Constrained Constraint Satisfaction Problems.

[BibT_eX]

[DOI]