Heuristics for branch-and-bound global allocation

Julio Septién, Daniel Mozos, Francisco Tirado, Román Hermida, M. Fernández · European Design Automation Conference · 1992

Wpaps&cnbesasetofhewistiadesignedto&dethe behabiauofaglobalbnmch-andbdundatt? dh~t~~An estimahm he, indudhgd~~~on area, is wed as costfunclim to be “ked A des@ space bounding havisa’callbwsto prunethe~~~space ina~~~~~ way hm othersystems do. Ihe muiu ndyis the incopration qf * desgnpxesemhpXnghewisticr,thatbyteor&itgthe available altemative~ lead first to the most dmng regicms of hedesignspace. 77thirspedsupthesduh~onseun%, leadingm pic& to the best accessible dtxp.

Read the paper · More papers on PaperTik