Eugene C. Freuder (freuder)

Contributions to Philosophie.ch

Bibliography

Bessiére, Christian, Freuder, Eugene C. and Régin, Jean-Charles. 1999. “Using Constraint Metaknowledge to Reduce Arc Consistency Computation.” Artificial Intelligence 107(1): 125–148.
Bessiére, Christian, Meseguer, Pedro, Freuder, Eugene C. and Larrosa, Javier. 2002. “On Forward Checking for Non-Binary Constraint Satisfaction.” Artificial Intelligence 141(1–2): 205–224.
Eaton, Peggy S., Freuder, Eugene C. and Lewis, Richard J. 1998. “Constraints and Agents: Confronting Ignorance.” The AI Magazine 19(2): 51–65.
Franzin, M. S., Freuder, Eugene C., Rossi, Francesca and Wallace, R. 2002. “Multi-Agent Meeting Scheduling with Preferences: Efficiency, Privacy Loss, and Solution Quality.” in AAAI-02. Preferences in AI and CP: Symbolic Approaches, edited by Ulrich Junker, pp. 25–32. Menlo Park, California: The AAAI Press.
Freuder, Eugene C. 1980. “On the Knowledge Required to Label a Picture Graph.” Artificial Intelligence 15(1–2): 1–17.
Freuder, Eugene C. 1991. “Completeable Representations of Constraint Satisfaction Problems.” in KR’91: Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning, edited by James F. Allen, Richard E. Fikes, and Erik Sandewall, pp. 186–195. San Francisco, California: Morgan Kaufmann Publishers.
Mackworth, Alan K. and Freuder, Eugene C. 1985. “The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems.” Artificial Intelligence 25(1): 65–74.
Mackworth, Alan K. and Freuder, Eugene C. 1993. “The Complexity of Constraint Satisfaction Revisited.” Artificial Intelligence 59(1–2): 57–62.
Wallace, Richard Jay and Freuder, Eugene C. 2002. “Meeting Scheduling with Preferences with Limited Comparability.” in AAAI-02. Preferences in AI and CP: Symbolic Approaches, edited by Ulrich Junker, pp. 107–114. Menlo Park, California: The AAAI Press.