Sciweavers

92 search results - page 15 / 19
» Deterministic Restrictions in Circuit Complexity
Sort
View
ICSOC
2004
Springer
14 years 22 days ago
Automated composition of e-services: lookaheads
The e-services paradigm promises to enable rich, flexible, and dynamic inter-operation of highly distributed, heterogeneous networkenabled services. Among the challenges, a funda...
Cagdas Evren Gerede, Richard Hull, Oscar H. Ibarra...
DAGSTUHL
2004
13 years 8 months ago
Information-Based Nonlinear Approximation: An Average Case Setting
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...
Leszek Plaskota
ICDT
2012
ACM
226views Database» more  ICDT 2012»
11 years 9 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 1 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
ICCAD
2006
IEEE
127views Hardware» more  ICCAD 2006»
14 years 4 months ago
Joint design-time and post-silicon minimization of parametric yield loss using adjustable robust optimization
Parametric yield loss due to variability can be effectively reduced by both design-time optimization strategies and by adjusting circuit parameters to the realizations of variable...
Murari Mani, Ashish Kumar Singh, Michael Orshansky