Howard E. Motteler

Learn More
The compl exi ty of searchi ng for a mi ni mum cost solution graph of an AND/OR graph i s anal yzed for the cl ass of AND/OR graphs repreaentabl e by a context free grammar with coat functions; finding a mi ni mum coat solution graph i a then equi val ent to fi ndi ng a l owest coat derivation. Several cl asses of search probl ems are defi ned, based on(More)
  • 1