Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("Fox, Maria")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 43

  • Page / 2
Export

Selection :

  • and

Recent advances in AI planning (Durham, 8-10 September 1999)Biundo, Susanne; Fox, Maria.Lecture notes in computer science. 2000, issn 0302-9743, isbn 3-540-67866-2, 372 p., isbn 3-540-67866-2Conference Proceedings

Planning as Model CheckingGIUNCHIGLIA, F; TRAVERSO, P.Lecture notes in computer science. 2000, pp 1-20, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Hierarchical task network planning as satisfiabilityAMOL DATTATRAYA MALI.Lecture notes in computer science. 2000, pp 122-134, issn 0302-9743, isbn 3-540-67866-2Conference Paper

GRT : A domain independent heuristic for STRIPS worlds based on Greedy Regression TablesREFANIDIS, I; VLAHAVAS, I.Lecture notes in computer science. 2000, pp 347-359, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Plan merging & plan reuse as satisfiabilityAMOL DATTATRAYA MALI.Lecture notes in computer science. 2000, pp 84-96, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Conformant planning via model checkingCIMATTI, A; ROVERI, M.Lecture notes in computer science. 2000, pp 21-34, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Scaling up planning by teasing out resource schedulingSRIVASTAVA, B; KAMBHAMPATI, S.Lecture notes in computer science. 2000, pp 172-186, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Some results on the complexity of Planning with incomplete informationHASLUM, P; JONSSON, P.Lecture notes in computer science. 2000, pp 308-318, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Action constraints for planningSCHOLZ, U.Lecture notes in computer science. 2000, pp 148-158, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Planning as heuristic search : New resultsBONET, B; GEFFNER, H.Lecture notes in computer science. 2000, pp 360-372, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Scaleability in planningLIATSOS, V; RICHARDS, B.Lecture notes in computer science. 2000, pp 49-61, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Making Graphplan goal-directedPARKER, E.Lecture notes in computer science. 2000, pp 333-346, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Numeric state variables in constraint-based planningRINTANEN, J; JUNGHOLT, H.Lecture notes in computer science. 2000, pp 109-121, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Exhibiting knowledge in planning problems to minimize state encoding lengthEDELKAMP, S; HELMERT, M.Lecture notes in computer science. 2000, pp 135-147, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Task decomposition support to reactive schedulingDRABBLE, B.Lecture notes in computer science. 2000, pp 200-212, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Integer programs and valid inequalities for planning problemsBOCKMAYR, A; DIMOPOULOS, Y.Lecture notes in computer science. 2000, pp 239-251, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Sensor planning with non-linear utility functionsKOENIG, S; YAXIN LIU.Lecture notes in computer science. 2000, pp 265-277, issn 0302-9743, isbn 3-540-67866-2Conference Paper

What is the expressive power of disjunctive preconditions?NEBEL, B.Lecture notes in computer science. 2000, pp 294-307, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Advances in Automated Plan GenerationFOX, Maria; THIEBAUX, Sylvie.Artificial intelligence (General ed.). 2009, Vol 173, Num 5-6, issn 0004-3702, 289 p.Serial Issue

Real-time scheduling for multi-agent call center automationYONG WANG; QIANG YANG; ZHONG ZHANG et al.Lecture notes in computer science. 2000, pp 187-199, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Automata-theoretic approach to planning for temporally extended goalsDE GIACOMO, G; VARDI, M. Y.Lecture notes in computer science. 2000, pp 226-238, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Deductive synthesis of recursive plans in linear logicCRESSWELL, S; SMAILL, A; RICHARDSON, J et al.Lecture notes in computer science. 2000, pp 252-264, issn 0302-9743, isbn 3-540-67866-2Conference Paper

A parallel algorithm for POMDP solutionPYEATT, L. D; HOWE, A. E.Lecture notes in computer science. 2000, pp 73-83, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Probabilistic planning in the Graphplan frameworkBLUM, A. L; LANGFORD, J. C.Lecture notes in computer science. 2000, pp 319-332, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Propice-plan : Toward a unified framework for planning and executionDESPOUYS, O; INGRAND, F. F.Lecture notes in computer science. 2000, pp 278-293, issn 0302-9743, isbn 3-540-67866-2Conference Paper

  • Page / 2