Sciweavers

9719 search results - page 279 / 1944
» Answer Set Optimization
Sort
View
CGO
2003
IEEE
15 years 10 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
INFOCOM
2012
IEEE
13 years 9 months ago
Squeezing the most out of interference: An optimization framework for joint interference exploitation and avoidance
—There is a growing interest in exploiting interference (rather than avoiding it) to increase network throughput. In particular, the so-called successive interference cancellatio...
Canming Jiang, Yi Shi, Y. Thomas Hou, Wenjing Lou,...
ENTCS
2002
181views more  ENTCS 2002»
15 years 6 months ago
Alias verification for Fortran code optimization
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
Thi Viet Nga Nguyen, François Irigoin
VLDB
2005
ACM
152views Database» more  VLDB 2005»
16 years 7 months ago
Composing, optimizing, and executing plans for bioinformatics web services
The emergence of a large number of bioinformatics datasets on the Internet has resulted in the need for flexible and efficient approaches to integrate information from multiple bio...
Snehal Thakkar, José Luis Ambite, Craig A. Knoblo...
PODS
2001
ACM
127views Database» more  PODS 2001»
16 years 6 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor