Sciweavers

797 search results - page 139 / 160
» Eliminating Proofs from Programs
Sort
View
MP
2010
94views more  MP 2010»
13 years 8 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
SIGSOFT
2010
ACM
13 years 7 months ago
Software economies
Software construction has typically drawn on engineering metaphors like building bridges or cathedrals, which emphasize architecture, specification, central planning, and determin...
David F. Bacon, Eric Bokelberg, Yiling Chen, Ian A...
ASPLOS
2004
ACM
14 years 3 months ago
Coherence decoupling: making use of incoherence
This paper explores a new technique called coherence decoupling, which breaks a traditional cache coherence protocol into two protocols: a Speculative Cache Lookup (SCL) protocol ...
Jaehyuk Huh, Jichuan Chang, Doug Burger, Gurindar ...
FPGA
2004
ACM
119views FPGA» more  FPGA 2004»
14 years 3 months ago
A quantitative analysis of the speedup factors of FPGAs over processors
The speedup over a microprocessor that can be achieved by implementing some programs on an FPGA has been extensively reported. This paper presents an analysis, both quantitative a...
Zhi Guo, Walid A. Najjar, Frank Vahid, Kees A. Vis...
KDD
2004
ACM
213views Data Mining» more  KDD 2004»
14 years 3 months ago
Analytical view of business data
This paper describes a logical extension to Microsoft Business Framework (MBF) called Analytical View (AV). AV consists of three components: Model Service for design time, Busines...
Adam Yeh, Jonathan Tang, Youxuan Jin, Sam Skrivan