5090 search results - page 873 / 1018 » Constructing Strategies for Programming |
122
click to vote
ICSE
2008
IEEE-ACM
16 years 4 months ago
2008
IEEE-ACM
Because the knowledge required for the construction of a complex software system is often widely distributed among its members, programmers routinely engage in collaboration with ...
107
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
118
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
121
click to vote
ICCAD
2007
IEEE
2007
IEEE
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
16 years 29 days ago
—Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is...
131
click to vote
CVPR
2010
IEEE
16 years 4 days ago
2010
IEEE
Recent advances in scene understanding and related tasks
have highlighted the importance of using regions to reason
about high-level scene structure. Typically, the regions are
...