Sciweavers

8695 search results - page 1694 / 1739
» Making the Complex Simple
Sort
View
WSC
2000
14 years 11 months ago
Model abstraction for discrete event systems using neural networks and sensitivity information
STRACTION FOR DISCRETE EVENT SYSTEMS USING NEURAL NETWORKS AND SENSITIVITY INFORMATION Christos G. Panayiotou Christos G. Cassandras Department of Manufacturing Engineering Boston ...
Christos G. Panayiotou, Christos G. Cassandras, We...
AAAI
1996
14 years 11 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
IJCAI
1993
14 years 11 months ago
A Model-Theoretic Approach to the Verification of Situated Reasoning Systems
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
Anand S. Rao, Michael P. Georgeff
NIPS
1993
14 years 11 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson
WSC
1994
14 years 11 months ago
AutoStat
Whether designing a new system or modifying an existing one, engineers want to take the guesswork out of finding the best possible solution. While there are many analysis methods ...
Matthew W. Rohrer
« Prev « First page 1694 / 1739 Last » Next »