Sciweavers

1220 search results - page 16 / 244
» Minimal Interval Completions
Sort
View
IRI
2006
IEEE
14 years 1 months ago
A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
Éric Grégoire, Bertrand Mazure, C&ea...
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
13 years 11 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
TNN
2011
132views more  TNN 2011»
13 years 2 months ago
Lower Upper Bound Estimation Method for Construction of Neural Network-Based Prediction Intervals
—Prediction intervals (PIs) have been proposed in the literature to provide more information by quantifying the level of uncertainty associated to the point forecasts. Traditiona...
Abbas Khosravi, Saeid Nahavandi, Douglas C. Creigh...
ARITH
2005
IEEE
14 years 1 months ago
Guaranteed Proofs Using Interval Arithmetic
This paper presents a set of tools for mechanical reasoning of numerical bounds using interval arithmetic. The tools implement two techniques for reducing decorrelation: interval ...
Marc Daumas, Guillaume Melquiond, César Mu&...
TR
2008
88views more  TR 2008»
13 years 7 months ago
Reliability Sampling Plans Under Progressive Type-I Interval Censoring Using Cost Functions
Abstract--This paper gives a reliability sampling plan for progressively type I interval censored life tests when the lifetime follows the exponential distribution. We use the maxi...
Syuan-Rong Huang, Shuo-Jye Wu