641 search results - page 88 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
179
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper addresses the problem of efficient maintenance of a materialized skyline view in response to skyline removals. While there has been significant progress on skyline quer...
78
Voted
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
CGO
2003
IEEE
15 years 3 months ago
2003
IEEE
Predicated execution can eliminate hard to predict branches and help to enable instruction level parallelism. Many current predication variants exist where the result update is co...
114
click to vote
AMOST
2007
ACM
15 years 1 months ago
2007
ACM
We have devised a novel technique to automatically generate test cases for a software system, combining black-box model-based testing with white-box parameterized unit testing. Th...