Skip to search formSkip to main contentSkip to account menu

Sparse conditional constant propagation

Known as: SCCP 
In computer science, sparse conditional constant propagation is an optimization frequently applied in compilers after conversion to static single… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
In this letter, we consider a bi-directional relay network in which two users, U1 and U2, exchange their information via a relay… 
2010
2010
Based on a new smoothing function, a smoothing Newton-type method is proposed for the solution of symmetric cone complementarity… 
2009
2009
In the solution methods of the symmetric cone complementarity problem (SCCP), the squared norm of a complementarity function… 
2009
2009
In this letter, the problem of training sequence design in a bi-directional relay network is investigated. The two nodes, Tx1 and… 
2007
2007
In distributed database systems the global database is partitioned into a collection of local databases stored at different sites… 
2007
2007
Orthogonal frequency-division multiplexing (OFDM) is a popular transmission format for emerging wireless communication systems… 
1992
1992
This dissertation investigates the concurrency control problem in software development environments (SDEs). The problem arises… 
1990
1990
  • A. Conway
  • 1990
  • Corpus ID: 61501007
A queuing network model for the common channel signaling network signaling system No.7 (SS7) is formulated. The model is…