378 search results - page 33 / 76 » How Many Ways Can One Draw a Graph |
139
click to vote
PLDI
1994
ACM
15 years 7 months ago
1994
ACM
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
155
Voted
ISCAPDCS
2004
15 years 5 months ago
2004
This paper describes a collaboration among computer scientists, dancers, and musicians on a production entitled "Fibonacci and Phi." Thematically, the production explore...
155
Voted
PPSN
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
127
click to vote
IEEEPACT
1998
IEEE
15 years 8 months ago
1998
IEEE
Register coalescing is used, as part of register allocation, to reduce the number of register copies. Developing efficient register coalescing heuristics is particularly important ...
186
click to vote
HASKELL
2006
ACM
15 years 9 months ago
2006
ACM
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...