![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 10 | Rina Dechter, Daniel Frost: Backjump-based backtracking for constraint satisfaction problems. Artif. Intell. 136(2): 147-188 (2002) | |
| 9 | Daniel Frost, Rina Dechter: Maintenance scheduling problems as benchmarks for constraint algorithms. Ann. Math. Artif. Intell. 26(1-4): 149-170 (1999) | |
| 8 | Daniel Frost, Rina Dechter: Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units. CP 1998: 469 | |
| 5 | Daniel Frost, Rina Dechter: Looking at Full Looking Ahead. CP 1996: 539-540 | |
| 4 | Daniel Frost, Rina Dechter: Look-Ahead Value Ordering for Constraint Satisfaction Problems. IJCAI (1) 1995: 572-578 | |
| 3 | Daniel Frost, Rina Dechter: Dead-End Driven Learning. AAAI 1994: 294-300 | |
| 2 | Daniel Frost, Rina Dechter: In Search of the Best Constraint Satisfaction Search. AAAI 1994: 301-306 |
Selection of 7 from 12 records - Daniel Frost has 4 coauthors
Copyright © 2009-11-29 by Michael Ley (ley@uni-trier.de)