Abstraction methods for resource allocation

These Ecole polytechnique federale de Lausanne EPFL, n° 1292 (1994)Institut d'informatique fondamentaleLaboratoire d'intelligence artificielle Reference doi:10.5075/epfl-thesis-1292Print copy in library catalog Record created on 2005-03-16, modified on 2017-05-12

[1]  A. Kempe.  On the Geographical Problem of the Four Colours , 1879 .

[2]  David C. Wood,et al.  A technique for colouring a graph applicable to large scale timetabling problems , 1969, Computer/law journal.

[3]  Alfred V. Aho,et al.  The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..

[4]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

[5]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[6]  Joseph Y.-T. Leung,et al.  An Optimal Solution for the Channel-Assignment Problem , 1979, IEEE Transactions on Computers.

[7]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

[8]  David A. Plaisted,et al.  Theorem Proving with Abstraction , 1981, Artif. Intell..

[9]  Thomas G. Dietterich,et al.  A Comparative Review of Selected Methods for Learning from Examples , 1983 .

[10]  Martin Charles Golumbic.  Algorithmic Aspects of Perfect Graphs , 1984 .

[11]  Brian C. Williams,et al.  Doing Time: Putting Qualitative Reasoning on Firmer Ground , 1986, AAAI.

[12]  Daniel S. Weld.  The Use of Aggregation in Causal Simulation , 1986, Artif. Intell..

[13]  Amy L. Lansky,et al.  Localized Representation and Planning Methods for Parallel Domains , 1987, AAAI.

[14]  Richard E. Korf,et al.  Planning as Search: A Quantitative Approach , 1987, Artif. Intell..

[15]  Esther M. Arkin,et al.  Scheduling jobs with fixed start and end times , 1987, Discret. Appl. Math..

[16]  Henry Meyniel,et al.  A New Property of Critical Imperfect Graphs and some Consequences , 1987, Eur. J. Comb..

[17]  Bruce A. Reed.  A note on even pairs , 1987, Discret. Math..

[18]  Dana Nau,et al.  Hierarchical Abstraction for Process Planning. , 1987 .

[19]  Drew McDermott,et al.  Temporal Data Base Management , 1987, Artif. Intell..

[20]  Arthur M. Farley,et al.  Plan Abstraction Based on Operator Generalization , 1988, AAAI.

[21]  Fausto Giunchiglia,et al.  Abstract Theorem Proving , 1989, IJCAI.

[22]  Paul S. Rosenbloom,et al.  Abstraction in Problem Solving and Learning , 1989, IJCAI.

[23]  DianeC . P. Smith,et al.  Database Abstractions: Aggregation and Generalization , 1989 .

[24]  Surajit Chaudhuri.  Generalization and a framework for query modification , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[25]  Qiming Chen,et al.  Cooperative Query Answering via Type Abstraction Hierarchy , 1991 .

[26]  Walter Hamscher,et al.  Modeling Digital Circuits for Troubleshooting , 1991, Artif. Intell..

[27]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[28]  Errol L. Lloyd,et al.  on the K-coloring of Intervals , 1991, Discret. Appl. Math..

[29]  Qiang Yang,et al.  Characterizing Abstraction Hierarchies for Planning , 1991, AAAI.

[30]  Igor Mozetic,et al.  Hierarchical Model-Based Diagnosis , 1991, Int. J. Man Mach. Stud..

[31]  Eugene C. Freuder.  Eliminating Interchangeable Values in Constraint Satisfaction Problems , 1991, AAAI.

[32]  Marek Kubale.  Some results concerning the complexity of restricted colorings of graphs , 1992, Discret. Appl. Math..

[33]  Boi,et al.  Building Temporal Abstractions , 1992 .

[34]  Irith Ben-Arroyo Hartman,et al.  Optimal K-Coloring and K-Nesting of Intervals , 1992, ISTCS.

[35]  M A Musen,et al.  A temporal-abstraction system for patient monitoring. , 1992, Proceedings. Symposium on Computer Applications in Medical Care.

[36]  Fausto Giunchiglia,et al.  A Theory of Abstraction , 1992, Artif. Intell..

[37]  Eugene C. Freuder,et al.  Interchangeability Preprocessing Can Improve Forward Checking Search , 1992, ECAI.

[38]  Thomas Ellman,et al.  Abstraction via Approximate Symmetry , 1993, IJCAI.

[39]  Thomas Ellman.  Synthesis of Abstraction Hierarchies for Constraint Satisfaction by Clustering Approximately Equivalent Objects , 1993, ICML.

[40]  Alois Haselböck,et al.  Exploiting Interchangeabilities in Constraint-Satisfaction Problems , 1993, IJCAI.

[41]  M A Musen,et al.  RESUME: a temporal-abstraction system for patient monitoring. , 1993, Computers and biomedical research, an international journal.

[42]  Berthe Y. Choueiry,et al.  Interactive Resource Allocation by Problem Decomposition and Temporal Abstractions , 1994 .

[43]  Berthe Y. Choueiry,et al.  A Decomposition Heuristic for Resource Allocation , 1994, ECAI.