Sciweavers

1091 search results - page 63 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
COR
2006
113views more  COR 2006»
13 years 7 months ago
Capacitated facility location problem with general setup cost
This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered....
Ling-Yun Wu, Xiang-Sun Zhang, Ju-Liang Zhang
ADCM
2007
155views more  ADCM 2007»
13 years 8 months ago
Numerical differentiation by radial basis functions approximation
Based on radial basis functions approximation, we develop in this paper a new computational algorithm for numerical diļ¬€erentiation. Under an a priori and an a posteriori choice r...
T. Wei, Y. C. Hon
SIGMOD
2007
ACM
192views Database» more  SIGMOD 2007»
14 years 8 months ago
Benchmarking declarative approximate selection predicates
Declarative data quality has been an active research topic. The fundamental principle behind a declarative approach to data quality is the use of declarative statements to realize...
Amit Chandel, Oktie Hassanzadeh, Nick Koudas, Moha...
ILP
2004
Springer
14 years 1 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
ICCAD
2001
IEEE
107views Hardware» more  ICCAD 2001»
14 years 4 months ago
A Convex Programming Approach to Positive Real Rational Approximation
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
Carlos P. Coelho, Joel R. Phillips, Luis Miguel Si...