K. McMillan. The SMV system. Technical Report CMU-CS-92-131, CarnegieMellon University, February 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Scheduler Activations: Effective Kernel Support for.. - Anderson, Bershad.. (1992) (281 citations) (Correct)
....between virtual and physical processors; in the presence of these factors, user level threads built on top of traditional processes can exhibit poor performance or even incorrect behavior. Multiprocessor operating systems such as Mach [Tevanian et al. 87] Topaz [Thacker et al. 88] and V [Cheriton 88] provide direct kernel support for multiple threads per address space. Programming with kernel threads avoids system integration problems: the threads that are used by the programmer or compiler are directly scheduled by the kernel. Unfortunately, the performance of thread management primitives ....
Chefitoh, D. The V Distributed System. Communications o/ the ACM, 31(3):314-333, March 1988. /Droves &: Cooper 88] Droves, R. and Cooper, E. C Threads. Technical Report CMU-CS-88-154, School of Computer Science, Carnegie-Mellon University, June 1988.
Engineering and Compiling Planning Domain Models to Promote .. - McCluskey, Porteous (2000) (13 citations) (Correct)
....typically involve moving boxes and robots to various locations, and moving the colour coded keys between rooms so that doors can be locked, unlocked or opened and closed. A useful strategy at this stage (which is supplied amongst the guidelines for modelling domains for the PRODIGY planning system [48]) is to try and formulate example problems and descriptions of their possible solutions and to consider how you would teach someone to perform the task. 7 room1 room2 room3 room4 room5 room6 room7 H T 1 3 2 4 6 5 L2 L7 L3 L4 L5 L6 L1 D robot (harry) blue key Light (on) Light ....
....The method has been used to construct object centred specifications for a range of planning domains, some familiar and some novel. These include R n , introduced earlier in this paper, Russell s Tyre World [49] STRIPS worlds [50] a job shop scheduling world (similar to the PRODIGY test domain [48]) and a warehouse world [34] We have used tools presented in section 4 to help acquire, validate and compile these domain models and have explored the effect upon planner performance of the operationalised models using various planning engines. The purpose of this section is to present some of ....
The PRODIGY Research Group, PRODIGY 4.0: The Manual and Tutorial. Technical Report CMU-CS-92-150, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, 1992.
Learning Problem-Solving Concepts by Reflecting on Problem.. - Stroulia, Goel (1994) (Correct)
.... correct behavior of its reasoning elements (i.e. XP instantiation, case interpretation) NOOS [25] views reasoning as transfer from precedents and uses reflection for learning by memorization of episodes. In NOOS reasoning and learning are modeled in a framework similar to task structures. MAX [18] uses a explicit description of a robot s capabilities to enable deliberative, and consequently more effective, integration of these capabilities. It focuses on self monitoring rather than recovery from failure. Failure recovery analysis [15] is another technique for planner modification. It uses ....
D.R. Kuokka: The Deliberative Integration of Planning, Execution, and Learning, Carnegie Mellon, Computer Science, Technical Report CMU-CS-90-135 (1990)
Be the Master of Your Success: How to Select Proper Heuristic.. - Yury Smirnov (Correct)
....In on line search, planning and scheduling approaches two major factors impose an impact on the efficiency: Presence of prior knowledge and learning activity. Online agent centered algorithms approach these two factors differently. Some utilize prior knowledge as static heuristic values to guide the agent (GSAT (Selman et al. 1992), Prodigy planner (Prodigy 1992) repairbased scheduler Gerry (Zweben Fox 1985) others reflect learning the problem domain in updating heuristic values (LRTA (Pemberton Korf 1992) Q learning) Some algorithms ignore prior knowledge and do not apply learning (random walk) However, despite ....
The PRODIGY Research Group under the Supervision of Jaime G. Carbonell. Prodigy 4.0: The manual and tutorial. Technical Report CMU-CS-92-150, CMU, 1992.
Learning and Value Function Approximation in Complex Decision.. - Van Roy (1998) (19 citations) Self-citation (Value Approximation) (Correct)
No context found.
Proceedings of the Workshop on Value Function Approximation, Machine Learning Conference 1995. Technical Report CMU-CS-95-206, Carnegie Mellon University, 1995.
Bounded Model Checking for Deontic Interpreted Systems - Wozna, Lomuscio, Penczek (Correct)
No context found.
K. McMillan. The SMV system. Technical Report CMU-CS-92-131, CarnegieMellon University, February 1992.
Verics: A Tool for Verifying Timed Automata and.. - Dembinski.. (2003) (Correct)
No context found.
K. McMillan. The SMV system. Technical Report CMU-CS-92-131, CarnegieMellon University, February 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC