Sciweavers

7430 search results - page 73 / 1486
» Programming Applications in CIFF
Sort
View
ASPLOS
2012
ACM
12 years 3 months ago
Architecture support for disciplined approximate programming
Disciplined approximate programming lets programmers declare which parts of a program can be computed approximately and consequently at a lower energy cost. The compiler proves st...
Hadi Esmaeilzadeh, Adrian Sampson, Luis Ceze, Doug...
IDA
2000
Springer
13 years 8 months ago
Reducing redundancy in characteristic rule discovery by using integer programming techniques
The discovery of characteristic rules is a well-known data mining task and has lead to several successful applications. However, because of the descriptive nature of characteristic...
Tom Brijs, Koen Vanhoof, Geert Wets
RC
2002
100views more  RC 2002»
13 years 7 months ago
Efficient Interval Linear Equality Solving in Constraint Logic Programming
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
Chong-Kan Chiu, Jimmy Ho-Man Lee
RV
2010
Springer
110views Hardware» more  RV 2010»
13 years 6 months ago
Interval Analysis for Concurrent Trace Programs Using Transaction Sequence Graphs
Abstract. Concurrent trace programs (CTPs) are slices of the concurrent programs that generate the concrete program execution traces, where inter-thread event order specific to th...
Malay K. Ganai, Chao Wang
TCAD
2011
13 years 3 months ago
GRIP: Global Routing via Integer Programming
Abstract—This work introduces GRIP, a global routing technique via integer programming. GRIP optimizes wirelength and via cost directly without going through a traditional layer ...
Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth