Sciweavers

4335 search results - page 279 / 867
» Privatizing Constraint Optimization
Sort
View
139
Voted
VLDB
2005
ACM
133views Database» more  VLDB 2005»
15 years 10 months ago
Caching with 'Good Enough' Currency, Consistency, and Completeness
SQL extensions that allow queries to explicitly specify data quality requirements in terms of currency and consistency were proposed in an earlier paper. This paper develops a dat...
Hongfei Guo, Per-Åke Larson, Raghu Ramakrish...
DATE
2002
IEEE
69views Hardware» more  DATE 2002»
15 years 9 months ago
Flip-Flop and Repeater Insertion for Early Interconnect Planning
We present a unified framework that considers flipflop and repeater insertion and the placement of flipflop/repeater blocks during RT or higher level design. We introduce the...
Ruibing Lu, Guoan Zhong, Cheng-Kok Koh, Kai-Yuan C...
DAC
2000
ACM
15 years 9 months ago
Watermarking while preserving the critical path
In many modern designs, timing is either a key optimization goal and/or a mandatory constraint. We propose the first intellectual property protection technique using watermarking ...
Seapahn Meguerdichian, Miodrag Potkonjak
IJCAI
2007
15 years 6 months ago
Symmetric Component Caching
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
Matthew Kitching, Fahiem Bacchus
UAI
2008
15 years 6 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht