Sciweavers

16091 search results - page 3052 / 3219
» Solving
Sort
View
146
Voted
NIPS
1993
15 years 5 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
134
Voted
OSDI
1996
ACM
15 years 5 months ago
Automatic Compiler-Inserted I/O Prefetching for Out-of-Core Applications
Current operating systems offer poor performance when a numeric application's working set does not fit in main memory. As a result, programmers who wish to solve "out-of...
Todd C. Mowry, Angela K. Demke, Orran Krieger
WEBNET
1996
15 years 5 months ago
Digital Libraries Based on Full-Text Retrieval
: Because digital libraries are expensive to create and maintain, Internet analogs of public libraries--reliable, quality, community services--have only recently begun to appear. A...
Ian H. Witten, Craig G. Nevill-Manning, Sally Jo C...
AAAI
1990
15 years 5 months ago
The Design of a Marker Passing Architecture for Knowledge Processing
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...
Wing Lee, Dan I. Moldovan
IJCAI
1989
15 years 5 months ago
And-Or Graphs Applied to RUE Resolution
In equality-based binary r e s o l u t i o n , the v i a b i l i t y t e s t is used as a decision mechanism to select disagreement sets and also to define the RUE u n i f i e r ....
Vincent J. Digricoli, James J. Lu, V. S. Subrahman...
« Prev « First page 3052 / 3219 Last » Next »