Sciweavers

692 search results - page 25 / 139
» BDD minimization for approximate computing
Sort
View
COR
2007
80views more  COR 2007»
14 years 10 months ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan
DIS
2007
Springer
15 years 4 months ago
On Approximating Minimum Infrequent and Maximum Frequent Sets
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
Mario Boley
95
Voted
CDC
2008
IEEE
206views Control Systems» more  CDC 2008»
15 years 5 months ago
Approximate dynamic programming using support vector regression
— This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architect...
Brett Bethke, Jonathan P. How, Asuman E. Ozdaglar
DAGSTUHL
2008
14 years 12 months ago
Error Bounds for Lanczos Approximations of Rational Functions of Matrices
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
Andreas Frommer, Valeria Simoncini
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
15 years 12 months ago
Efficient Approximation Algorithms for Repairing Inconsistent Databases
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
Andrei Lopatenko, Loreto Bravo