2344 search results - page 265 / 469 » Generating from a Deep Structure |
125
click to vote
ICCAD
2006
IEEE
16 years 2 days ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
153
click to vote
GG
2008
Springer
15 years 4 months ago
2008
Springer
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
145
click to vote
ICCBR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Case-Based Reasoning (CBR) solves problems by reusing past problemsolving experiences maintained in a casebase. The key CBR knowledge container therefore is its casebase....
130
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper describes an unsupervised learning technique for modeling human locomotion styles, such as distinct related activities (e.g. running and striding) or variations of the ...
123
click to vote
KBSE
2009
IEEE
15 years 10 months ago
2009
IEEE
Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structur...