Sciweavers

30 search results - page 6 / 6
» A Tribute to Eugene Freuder
Sort
View
ECAI
2000
Springer
13 years 9 months ago
Dispatchability Conditions for Schedules with Consumable Resources
Earlier work on scheduling by autonomous systems has demonstrated that schedules in the form of simple temporal networks, with intervals of values for possible event-times, can be ...
Richard J. Wallace, Eugene C. Freuder
IJCAI
2007
13 years 6 months ago
Arc Consistency during Search
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
Chavalit Likitvivatanavong, Yuanlin Zhang, Scott S...
AAAI
1996
13 years 6 months ago
Neighborhood Inverse Consistency Preprocessing
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
Eugene C. Freuder, Charles D. Elfe
AI
2005
Springer
13 years 4 months ago
Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
Richard J. Wallace, Eugene C. Freuder
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 5 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...