10890 search results - page 1824 / 2178 » Automatic Complexity Analysis |
272
click to vote
LAWEB
2006
IEEE
16 years 20 days ago
2006
IEEE
Complex applications, in particular Web applications, deal with a myriad of different concerns and some of them affect several others. The result is that these crosscutting concer...
172
click to vote
SCAM
2006
IEEE
16 years 20 days ago
2006
IEEE
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
181
click to vote
SIPS
2006
IEEE
16 years 20 days ago
2006
IEEE
—A wide variety of DSP design tools have been developed that incorporate dataflow graph representations into their GUI-based design environments. However, as the complexity of ap...
150
click to vote
SIPS
2006
IEEE
16 years 20 days ago
2006
IEEE
Although many stopping methods of iterative decoding have been discussed in the literatures extensively, many of them only focus on the solvable decoding. In this paper, we propos...
159
click to vote
SKG
2006
IEEE
16 years 20 days ago
2006
IEEE
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...