406 search results - page 45 / 82 » Boosting Using Branching Programs |
ICCS
2004
Springer
14 years 1 months ago
2004
Springer
We summarize the Computational Engineering and Science program at the University of Utah. Program requirements as well as related research areas are outlined. To obtain the MS degr...
IOR
2006
13 years 8 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
LCPC
2005
Springer
14 years 2 months ago
2005
Springer
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant ...
RTSS
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper presents a quantification of the timing effects that advanced processor features like data and instruction cache, pipelines, branch prediction units and out-oforder ex...