An effective near-optimal state-space search method: an application to a scheduling problem (Q1768895)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An effective near-optimal state-space search method: an application to a scheduling problem |
scientific article; zbMATH DE number 2146283
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective near-optimal state-space search method: an application to a scheduling problem |
scientific article; zbMATH DE number 2146283 |
Statements
An effective near-optimal state-space search method: an application to a scheduling problem (English)
0 references
15 March 2005
0 references
iterative-deepening
0 references
learning real-time
0 references
scheduling
0 references
search
0 references
state-space
0 references
0.7093721628189087
0 references
0.702816903591156
0 references
