Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Solution reuse in dynamic constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Constraint Processing
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Robust solutions for constraint satisfaction and optimization
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Certainty closure: Reliable constraint reasoning with incomplete or erroneous data
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.01 |
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We show how to model the problem as constraint satisfaction, with extensions which generate flexible seating plans and which maintain stability when changes occur. We describe an implemented system which provides advice to users in real time. The system is currently being evaluated in a restaurant environment.