Sciweavers

196 search results - page 3 / 40
» Canonizable Partial Order Generators
Sort
View
AAAI
1994
14 years 5 days ago
Derivation Replay for Partial-Order Planning
Derivation replay was first proposed by Carbonell as a method of transferring guidancefrom a previousproblemsolving episode to a new one. Subsequent implementations have used stat...
Laurie H. Ihrig, Subbarao Kambhampati
CP
2004
Springer
14 years 4 months ago
Generating Robust Partial Order Schedules
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A...
JOC
2010
96views more  JOC 2010»
13 years 5 months ago
On the Efficient Generation of Prime-Order Elliptic Curves
We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
Elisavet Konstantinou, Aristides Kontogeorgis, Yan...
AAAI
2004
14 years 8 days ago
Generating Safe Assumption-Based Plans for Partially Observable, Nondeterministic Domains
Reactive planning using assumptions is a well-known approach to tackle complex planning problems for nondeterministic, partially observable domains. However, assumptions may be wr...
Alexandre Albore, Piergiorgio Bertoli
LFCS
1992
Springer
14 years 2 months ago
Machine Learning of Higher Order Programs
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
Ganesh Baliga, John Case, Sanjay Jain, Mandayam Su...