أعرض تسجيلة المادة بشكل مبسط
| dc.creator |
Betke, Margrit |
|
| dc.creator |
Rivest, Ronald L. |
|
| dc.creator |
Singh, Mona |
|
| dc.date |
2004-10-08T20:35:47Z |
|
| dc.date |
2004-10-08T20:35:47Z |
|
| dc.date |
1994-03-01 |
|
| dc.date.accessioned |
2013-10-09T02:46:11Z |
|
| dc.date.available |
2013-10-09T02:46:11Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
AIM-1474 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/6627 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
We introduce a new learning problem: learning a graph by piecemeal search, in which the learner must return every so often to its starting point (for refueling, say). We present two linear-time piecemeal-search algorithms for learning city-block graphs: grid graphs with rectangular obstacles. |
|
| dc.format |
195855 bytes |
|
| dc.format |
691585 bytes |
|
| dc.format |
application/octet-stream |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.relation |
AIM-1474 |
|
| dc.title |
Piecemeal Learning of an Unknown Environment |
|
الملفات في هذه المادة
|
لا توجد أي ملفات مرتبطة بهذه المادة.
|
هذه المادة تبدو في المجموعات التالية:
أعرض تسجيلة المادة بشكل مبسط