default search action
Richard J. Wallace
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c59]Richard J. Wallace
:
Explaining the Effects of Preprocessing on Constraint Satisfaction Search. AICS 2022: 423-436 - 2021
- [b1]Richard J. Wallace:
Artificial Intelligence / Human Intelligence - An Indissoluble Nexus. WorldScientific 2021, ISBN 9789811232879, pp. 1-368 - 2020
- [j20]Richard J. Wallace:
Partial (Neighbourhood) Singleton Arc Consistency for Constraint Satisfaction Problems. Fundam. Informaticae 174(3-4): 311-344 (2020) - [c58]Richard J. Wallace:
Interleaving Levels of Consistency Enforcement for Singleton Arc Consistency in CSPs, with a New Best (N)SAC Algorithm. AI*IA 2020: 301-317
2010 – 2019
- 2018
- [c57]Richard J. Wallace:
Partial (Neighbourhood) Singleton Arc Consistency for Constraint Satisfaction Problems. FLAIRS 2018: 140-145 - 2017
- [c56]Richard J. Wallace:
A Normative-Prescriptive-Descriptive Approach to Analyzing CSP Heuristics. FLAIRS 2017: 158-163 - [c55]Eugene C. Freuder, Richard J. Wallace:
Replaceability and the Substitutability Hierarchy for Constraint Satisfaction Problems. GCAI 2017: 51-63 - 2016
- [j19]Laura Climent
Uncertainty in dynamic constraint satisfaction problems. AI Commun. 29(1): 239-241 (2016) - [j18]Richard J. Wallace:
Neighbourhood SAC: Extensions and new algorithms. AI Commun. 29(2): 249-268 (2016) - [j17]Laura Climent
Extrapolating from Limited Uncertain Information in Large-Scale Combinatorial Optimization Problems to Obtain Robust Solutions. Int. J. Artif. Intell. Tools 25(1): 1660005:1-1660005:21 (2016) - [c54]Richard J. Wallace:
Complexity Analysis vs. Engineering Design in CSP Algorithms: Contravening Conventional Wisdom Again. RCRA@AI*IA 2016: 73-87 - [c53]Richard J. Wallace:
Preprocessing versus Search Processing for Constraint Satisfaction Problems. RCRA@AI*IA 2016: 89-103 - [c52]Richard J. Wallace:
Neighbourhood SAC for Constraint Satisfaction Problems with Non-Binary Constraints. FLAIRS 2016: 162-166 - [c51]Laura Climent, Barry O'Sullivan, Richard J. Wallace:
An Improved Metaheuristic Algorithm for Maximizing Demand Satisfaction in the Population Harvest Cutting Stock Problem. SOCS 2016: 127-128 - 2015
- [j16]Richard J. Wallace:
SAC and neighbourhood SAC. AI Commun. 28(2): 345-364 (2015) - [j15]Laura Climent
Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings. Artif. Intell. Rev. 44(2): 131-156 (2015) - [c50]Richard J. Wallace:
Light-Weight versus Heavy-Weight Algorithms for SAC and Neighbourhood SAC. FLAIRS 2015: 91-96 - 2014
- [j14]Laura Climent
Robustness and Stability in Constraint Programming under Dynamism and Uncertainty. J. Artif. Intell. Res. 49: 49-78 (2014) - [c49]Laura Climent
Robustness and Stability in Constraint Programming under Dynamism and Uncertainty - (Extended Abstract). CP 2014: 923-927 - [c48]Richard J. Wallace, Antonino Marvuglia
A New Approach to Optimization with Life Cycle Assessment: Combining Optimization with Detailed Process Simulation. ICCSA (3) 2014: 707-720 - [c47]Laura Climent
Extrapolating from Limited Uncertain Information to Obtain Robust Solutions for Large-Scale Optimization Problems. ICTAI 2014: 898-905 - 2013
- [c46]Laura Climent
Modeling Robustness in CSPs as Weighted CSPs. CPAIOR 2013: 44-60 - 2012
- [c45]Laura Climent
An Algorithm for Finding Robust and Stable Solutions for Constraint Satisfaction Problems with Discrete and Ordered Domains. ICTAI 2012: 874-879 - 2010
- [j13]Eugene C. Freuder, Robert Heffernan, Richard J. Wallace, Nic Wilson
Lexicographically-ordered constraint satisfaction problems. Constraints An Int. J. 15(1): 1-28 (2010)
2000 – 2009
- 2009
- [j12]Richard J. Wallace, Nic Wilson
Conditional lexicographic orders in constraint satisfaction problems. Ann. Oper. Res. 171(1): 3-25 (2009) - [c44]Richard J. Wallace, Diarmuid Grimes, Eugene C. Freuder:
Dynamic Constraint Satisfaction Problems: Relations among Search Strategies, Solution Sets and Algorithm Performance. CSCLP 2009: 105-121 - [c43]Richard J. Wallace, Diarmuid Grimes, Eugene C. Freuder:
Solving Dynamic Constraint Satisfaction Problems by Identifying Stable Features. IJCAI 2009: 621-627 - [c42]Ioannis M. Dokas, Richard J. Wallace, Radu Marinescu, Syed Imran
Towards a novel early warning service for state agencies: A feasibility study. ITEE 2009: 162-175 - 2008
- [j11]Richard J. Wallace:
Determining the Principles Underlying Performance Variation in CSP Heuristics. Int. J. Artif. Intell. Tools 17(5): 857-880 (2008) - [j10]Richard J. Wallace, Diarmuid Grimes:
Experimental studies of variable selection strategies based on constraint weights. J. Algorithms 63(1-3): 114-129 (2008) - [c41]Richard J. Wallace, Diarmuid Grimes, Eugene C. Freuder:
Solving Dynamic Constraint Satisfaction Problems by Identifying Stable Features. RCRA 2008 - 2007
- [c40]Richard J. Wallace, Stuart Bain:
Branching Rules for Satisfiability Analysed with Factor Analysis. Australian Conference on Artificial Intelligence 2007: 803-809 - [c39]Richard J. Wallace, Tomas Eric Nordlander, Ioannis M. Dokas:
Ontologies as Contexts for Constraint-based Reasoning. C&O:RR 2007 - [c38]Diarmuid Grimes, Richard J. Wallace:
Sampling Strategies and Variable Selection in Weighted Degree Heuristics. CP 2007: 831-838 - [c37]Diarmuid Grimes, Richard J. Wallace:
Learning to Identify Global Bottlenecks in Constraint Satisfaction Search. FLAIRS 2007: 592-597 - [c36]Richard J. Wallace:
Determining the Basis for Performance Variations in CSP Heuristics. ICTAI (2) 2007: 473-480 - [c35]Tomas Eric Nordlander, Eugene C. Freuder, Richard J. Wallace:
Maintaining constraint-based applications. K-CAP 2007: 79-86 - 2006
- [c34]Richard J. Wallace, Nic Wilson
Conditional Lexicographic Orders in Constraint Satisfaction Problems. CPAIOR 2006: 258-272 - [c33]Susan L. Epstein, Richard J. Wallace:
Finding Crucial Subproblems to Focus Global Search. ICTAI 2006: 151-162 - [c32]Richard J. Wallace:
Heuristic Policy Analysis and Efficiency Assessment in Constraint Satisfaction Search. ICTAI 2006: 305-314 - 2005
- [j9]Richard J. Wallace, Eugene C. Freuder:
Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving. Artif. Intell. 161(1-2): 209-227 (2005) - [j8]Susan L. Epstein, Eugene C. Freuder, Richard J. Wallace:
Learning to Support Constraint Programmers. Comput. Intell. 21(4): 336-371 (2005) - [j7]Richard J. Wallace, Eugene C. Freuder:
Supporting dispatchability in schedules with consumable resources. J. Sched. 8(1): 7-23 (2005) - [c31]Richard J. Wallace:
Analysis of Heuristic Synergies. CSCLP 2005: 73-87 - 2004
- [j6]M. S. Franzin, Francesca Rossi, Eugene C. Freuder, Richard J. Wallace:
Multi-Agent Constraint Systems with Preferences: Efficiency, Solution Quality, and Privacy Loss. Comput. Intell. 20(2): 264-286 (2004) - [c30]J. Christopher Beck, Patrick Prosser, Richard J. Wallace:
Variable Ordering Heuristics Show Promise. CP 2004: 711-715 - [c29]Marius-Calin Silaghi, Vaibhav Rajeshirke, Richard J. Wallace:
A Web-Based Meeting Scheduling Solver With Privacy Guarantees, Without Trusted Servers. CP 2004: 818 - [c28]J. Christopher Beck, Patrick Prosser, Richard J. Wallace:
Trying Again to Fail-First. CSCLP 2004: 41-55 - [c27]J. Christopher Beck, Patrick Prosser, Richard J. Wallace:
Failing First: An Update. ECAI 2004: 959-960 - [c26]Georg Ringwelski, Richard J. Wallace:
Constraint Processing with Reactive Agents. FLAIRS 2004: 293-299 - [c25]Richard J. Wallace, Marius-Calin Silaghi:
Using Privacy Loss to Guide Decisions During Distributed CSP Search. FLAIRS 2004: 770-775 - [c24]Richard J. Wallace, Eugene C. Freuder, Marius Minca:
Possibilistic Reasoning and Privacy/Efficiency Tradeoffs in Multi-agent Systems. MICAI 2004: 380-389 - 2003
- [j5]Tudor Hulubei, Eugene C. Freuder, Richard J. Wallace:
The Goldilocks problem. Artif. Intell. Eng. Des. Anal. Manuf. 17(1): 3-11 (2003) - [c23]Mihaela Sabin, Eugene C. Freuder, Richard J. Wallace:
Greater Efficiency for Conditional Constraint Satisfaction. CP 2003: 649-663 - 2002
- [j4]Eugene C. Freuder, Richard J. Wallace:
Suggestion Strategies for Constraint-Based Matchmaker Agents. Int. J. Artif. Intell. Tools 11(1): 3-18 (2002) - [c22]Eugene C. Freuder, Chavalit Likitvivatanavong, Manuela Moretti, Francesca Rossi, Richard J. Wallace:
Computing Explanations and Implications in Preference-Based Configurators. International Workshop on Constraint Solving and Constraint Logic Programming 2002: 76-92 - [c21]Susan L. Epstein, Eugene C. Freuder, Richard J. Wallace, Anton Morozov, Bruce Samuels:
The Adaptive Constraint Engine. CP 2002: 525-542 - [c20]Richard J. Wallace:
Representing Possibilities in Relation to Constraints and Agents. JELIA 2002: 407-418 - 2001
- [c19]Eugene C. Freuder, Chavalit Likitvivatanavong, Richard J. Wallace:
Deriving Explanations and Implications for Constraint Satisfaction Problems. CP 2001: 585-589 - [e1]Eugene C. Freuder, Richard J. Wallace:
Constraint Programming and Large Scale Discrete Optimization, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, September 14-17, 1998. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 57, DIMACS/AMS 2001, ISBN 978-0-8218-2710-9 [contents] - 2000
- [c18]Richard J. Wallace, Eugene C. Freuder:
Dispatchable Execution of Schedules Involving Consumable Resources. AIPS 2000: 283-290 - [c17]Richard J. Wallace, Eugene C. Freuder:
Dispatchability Conditions for Schedules with Consumable Resources. ECAI 2000: 536-542
1990 – 1999
- 1998
- [j3]Peggy S. Eaton, Eugene C. Freuder, Richard J. Wallace:
Constraints and Agents Confronting Ignorance. AI Mag. 19(2): 51-65 (1998) - [c16]Eugene C. Freuder, Richard J. Wallace:
Suggestion Strategies for Constraint-Based Matchmaker Agents. CP 1998: 192-204 - [c15]Richard J. Wallace, Eugene C. Freuder:
Stable Solutions for Dynamic Constraint Satisfaction Problems. CP 1998: 447-461 - [c14]Richard J. Wallace, Eugene C. Freuder:
Introduction to DIMACS workshop on Constraint Programming and Large Scale Discrete Optimization. Constraint Programming and Large Scale Discrete Optimization 1998: 1-5 - 1997
- [c13]Eugene C. Freuder, Richard J. Wallace:
Suggestion Strategies for Constraint-Based Matchmaker Agents. AAAI Workshop: Constraints & Agents 1997: 105-111 - 1996
- [j2]Richard J. Wallace, Eugene C. Freuder:
Anytime Algorithms for Constraint Satisfaction and SAT Problems. SIGART Bull. 7(2): 7-10 (1996) - [c12]Richard J. Wallace:
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem. AAAI/IAAI, Vol. 1 1996: 188-195 - [c11]Richard J. Wallace:
Enhancing Maximum Satisfiablility Algorithms with Pure Literal Strategies. AI 1996: 388-401 - [c10]Richard J. Wallace:
Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems. CP 1996: 482-496 - 1995
- [c9]Eugene C. Freuder, Richard J. Wallace:
Partial Constraint Satisfaction. Over-Constrained Systems 1995: 63-110 - [c8]Richard J. Wallace:
Directed Arc Consistency Preprocessing. Constraint Processing, Selected Papers 1995: 121-137 - [c7]Richard J. Wallace, Eugene C. Freuder:
Heuristic Methods for Over-Constrained Constraint Satisfaction Problems. Over-Constrained Systems 1995: 207-216 - [c6]Richard J. Wallace:
Cascaded Directed Arc Consistency and No-Good Learning for the Maximal Constraint Satisfaction Problem. Over-Constrained Systems 1995: 217-228 - [c5]Eugene C. Freuder, Richard J. Wallace:
Generalizing Inconsistency Learning for Constraint Satisfaction. IJCAI 1995: 563-571 - 1993
- [c4]Richard J. Wallace, Eugene C. Freuder:
Conjunctive Width Heuristics for Maximal Constraint Satisfaction. AAAI 1993: 762-768 - [c3]Richard J. Wallace, Eugene C. Freuder:
Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. Cliques, Coloring, and Satisfiability 1993: 587-615 - [c2]Richard J. Wallace:
Why AC-3 is Almost Always Better than AC4 for Establishing Arc Consistency in CSPs. IJCAI 1993: 239-247 - 1992
- [j1]Eugene C. Freuder, Richard J. Wallace:
Partial Constraint Satisfaction. Artif. Intell. 58(1-3): 21-70 (1992) - 1991
- [c1]Eugene C. Freuder, Richard J. Wallace:
Selective relaxation for constraint satisfaction problems. ICTAI 1991: 332-339
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: