200 search results - page 4 / 40 » On the decidability of phase ordering problem in optimizing ... |
MICRO
1996
IEEE
13 years 11 months ago
1996
IEEE
A machine description facility allows compiler writers to specify machine execution constraints to the optimization and scheduling phases of an instruction-level parallelism (ILP)...
ISCAS
2002
IEEE
14 years 11 days ago
2002
IEEE
In this paper we introduce the PCPH (Pseudo-Chaotic Phase Hopping) telecommunication scheme, which is obtained by combining pseudo-chaotic encoding with N-ary phase shift keying. ...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
DOLAP
2007
ACM
13 years 11 months ago
2007
ACM
In this paper, we deal with the problem of determining the best possible physical implementation of an ETL workflow, given its logical-level description and an appropriate cost mo...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as...