RIGOROUS SOLUTION TECHNIQUES FOR NUMERICAL CONSTRAINT SATISFACTION PROBLEMS
暂无分享,去创建一个
[1] Marc Torrens,et al. Scalable Intelligent Electronic Catalogs , 2002 .
[2] Boi Faltings,et al. Local Consistency for Ternary Numeric Constraints , 1997, IJCAI.
[3] Kiyotaka Yamamura,et al. Interval solution of nonlinear equations using linear programming , 1997, Proceedings of 1997 IEEE International Symposium on Circuits and Systems. Circuits and Systems in the Information Age ISCAS '97.
[4] Ramon E. Moore. A Test for Existence of Solutions to Nonlinear Systems , 1977 .
[5] Toby Walsh,et al. Singleton Consistencies , 2000, CP.
[6] Boi Faltings,et al. Arc-Consistency for Continuous Variables , 1994, Artif. Intell..
[7] A. Neumaier. Interval iteration for zeros of systems of equations , 1985 .
[8] G. Alefeld,et al. Introduction to Interval Computation , 1983 .
[9] A. Neumaier. Further results on linear interval equations , 1987 .
[10] Arnold Neumaier,et al. Benchmarking Global Optimization and Constraint Satisfaction Codes , 2002, COCOS.
[11] Fabio Ganovelli,et al. BucketTree: Improving Collision Detection Between Deformable Objects , 2000 .
[12] David L. Waltz,et al. Generating Semantic Descriptions From Drawings of Scenes With Shadows , 1972 .
[13] Lubomir V. Kolev. A New Method for Global Solution of Systems of Non-Linear Equations , 1998, Reliab. Comput..
[14] Chryssostomos Chryssostomidis,et al. Computer methods for design automation , 1992 .
[15] J. C. Burkill. Functions of Intervals , 1924 .
[16] Shin'ichi Oishi,et al. Finding All Solutions of Nonlinear Systems of Equations Using Linear Programming with Guaranteed Accuracy , 1998, J. Univers. Comput. Sci..
[17] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[18] Kiyotaka Yamamura. Finding All Solutions of Nonlinear Equations Using Linear Combinations of Functions , 2000, Reliab. Comput..
[19] Arnold Neumaier,et al. Benchmarking global optimization and constraint satisfaction codes , 2003 .
[20] Krzysztof R. Apt,et al. Principles of constraint programming , 2003 .
[21] De Figueiredo,et al. Self-validated numerical methods and applications , 1997 .
[22] Yasuaki Inoue,et al. A Practical Approach for the Fixed-Point Homotopy Method Using a Solution-Tracing Circuit , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[23] Günter Mayer,et al. Epsilon-inflation in verification algorithms , 1995 .
[24] M. H. van Emden,et al. Interval arithmetic: From principles to implementation , 2001, JACM.
[25] E. Kaucher,et al. Small Bounds for the Solution of Systems of Linear Equations , 1980 .
[26] Eric Monfroy,et al. Improved bounds on the complexity of kB-consistency , 2001, IJCAI.
[27] Joachim Gudmundsson,et al. Box-trees for collision checking in industrial installations , 2004, Comput. Geom..
[28] Frédéric Benhamou,et al. Heterogeneous Constraint Solving , 1996, ALP.
[29] A. E. Eiben,et al. Solving constraint satisfaction problems using genetic algorithms , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[30] Nikolaos V. Sahinidis,et al. Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming , 2002 .
[31] Ramon E. Moore,et al. A Successive Interval Test for Nonlinear Systems , 1982 .
[32] K. Deimling. Fixed Point Theory , 2008 .
[33] David M. GAYt. SOLVING INTERVAL LINEAR EQUATIONS , 1982 .
[34] W. A. Kirk,et al. Handbook of metric fixed point theory , 2001 .
[35] Earl E. Swartzlander,et al. The Sign/Logarithm Number System , 1975, IEEE Transactions on Computers.
[36] Pierre Spiteri,et al. A New Characterization of M-Matrices and H-Matrices , 2003 .
[37] Ivan E. Sutherland,et al. Sketchpad a Man-Machine Graphical Communication System , 1899, Outstanding Dissertations in the Computer Sciences.
[38] Yasuaki Inoue,et al. An Initial Solution Algorithm for Globally Convergent Homotopy Methods , 2004 .
[39] Algirdas Avizienis,et al. Signed-Digit Numbe Representations for Fast Parallel Arithmetic , 1961, IRE Trans. Electron. Comput..
[40] A. Neumaier. New techniques for the analysis of linear interval equations , 1984 .
[41] C. Fahn,et al. Efficient Time-Interrupted and Time-Continuous Collision Detection Among Polyhedral Objects in Arbitrary Motion , 1999 .
[42] Claude Brezinski,et al. Generative modeling for computer graphics and CAD , 1993 .
[43] Ugo Montanari,et al. Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..
[44] Marius-Calin Silaghi,et al. Résolution de problèmes non linéaires avec continuum de solutions , 2002, JFPLC.
[45] Frédéric Goualard,et al. Box consistency through weak box consistency , 1999, Proceedings 11th International Conference on Tools with Artificial Intelligence.
[46] Kaisheng Du,et al. The Cluster Problem in Global Optimization: the Univariate Case , 1993 .
[47] Boi Faltings,et al. Combining multiple inclusion representations in numerical constraint propagation , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.
[48] E. Allgower,et al. Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations , 1980 .
[49] A. Pnueli,et al. Effective synthesis of switching controllers for linear systems , 2000, Proceedings of the IEEE.
[50] Laurent Granvilliers. Consistances locales et transformations symboliques de contraintes d'intervalles , 1998 .
[51] Rudolf Krawczyk. Conditionally isotone interval operators , 2006, Computing.
[52] Lubomir V. Kolev,et al. An Improved Interval Linearization for Solving Nonlinear Problems , 2004, Numerical Algorithms.
[53] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[54] J. McNamee. A supplementary bibliography On roots of polynomials , 1997 .
[55] Lubomir V. Kolev. An Improved Method for Global Solution of Non-Linear Systems , 1999, Reliab. Comput..
[56] Christian Frei. Abstraction techniques for resource allocation in communication networks , 2000 .
[57] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[58] Kiyotaka Yamamura,et al. An algorithm for representing functions of many variables by superpositions of functions of one variable and addition , 1996 .
[59] R. Baker Kearfott,et al. Slope Intervals, Generalized Gradients, Semigradients, Slant Derivatives, and Csets , 2004, Reliab. Comput..
[60] Wei Wang,et al. A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations , 1996 .
[61] Richard J. Wallace,et al. Partial Constraint Satisfaction , 1989, IJCAI.
[62] Kiyotaka Yamamura,et al. Finding all characteristic curves of nonlinear resistive circuits using the dual simplex method , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).
[63] Siegfried M. Rump,et al. On the solution of interval linear systems , 1991, Computing.
[64] Peter van Beek,et al. On the minimality and global consistency of row-convex constraint networks , 1995, JACM.
[65] E. Hansen,et al. Bounding solutions of systems of equations using interval analysis , 1981 .
[66] Richard E. Korf,et al. Improved Limited Discrepancy Search , 1996, AAAI/IAAI, Vol. 1.
[67] Olivier Bournez,et al. On the Representation of Timed Polyhedra , 2000, ICALP.
[68] Boi Faltings,et al. Constraint Consistency Techniques for Continuous Domains , 1995 .
[69] Pascal Van Hentenryck,et al. CLP(Intervals) Revisited , 1994, ILPS.
[70] John Michael McNamee. An updated supplementary bibliography on roots of polynomials , 1999 .
[71] Ramon E. Moore. Methods and applications of interval analysis , 1979, SIAM studies in applied mathematics.
[72] Rudolf Krawczyk. A remark about the convergence of interval sequences , 2005, Computing.
[73] Pedro Barahona,et al. Maintaining Global Hull Consistency with Local Search for Continuous CSPs , 2002, COCOS.
[74] Etienne Huens,et al. Algorithms for Solving Non-Linear Constrained and Optimization Problems: The State of The Art , 2001 .
[75] Jiri Rohn,et al. Enclosing Solutions of Linear Equations , 1998 .
[76] Kiyotaka Yamamura. Finding All Solution Sets of Piecewise-Trapezoidal Equations Described by Set-Valued Functions , 2003, Reliab. Comput..
[77] W. Miller,et al. Quadratic convergence in interval arithmetic, part I , 1972 .
[78] Arnold Neumaier,et al. An improved interval Newton operator , 1986 .
[79] Frédéric Benhamou,et al. Applying Interval Arithmetic to Real, Integer, and Boolean Constraints , 1997, J. Log. Program..
[80] George Boole,et al. An Investigation of the Laws of Thought: Frontmatter , 2009 .
[81] Roger Mohr,et al. Good Old Discrete Relaxation , 1988, ECAI.
[82] Toby Walsh. Depth-bounded Discrepancy Search , 1997, IJCAI.
[83] Pedro Meseguer. Interleaved Depth-First Search , 1997, IJCAI.
[84] Gaétan Hains,et al. A conservative scheme for parallel interval narrowing , 2000, Inf. Process. Lett..
[85] In-Kwon Lee,et al. Adaptive space decomposition for fast visualization of soft objects , 2003, Comput. Animat. Virtual Worlds.
[86] Claudio Lottaz,et al. Rewriting Numeric CSPs for Consistency Algorithms , 1999, International Joint Conference on Artificial Intelligence.
[87] Gino van den Bergen. Efficient Collision Detection of Complex Deformable Models using AABB Trees , 1997, J. Graphics, GPU, & Game Tools.
[88] Arnold Neumaier,et al. Existence of solutions of piecewise differentiable systems of equations , 1986 .
[89] A. Neumaier. Interval methods for systems of equations , 1990 .
[90] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[91] W. A. Kirk,et al. An Introduction to Metric Spaces and Fixed Point Theory , 2001 .
[92] Matthew L. Ginsberg,et al. Dynamic Backtracking , 1993, J. Artif. Intell. Res..
[93] Günter Mayer. Enclosing the solution set of linear systems with inaccurate data by iterative methods based on incomplete LU-decompositions , 2005, Computing.
[94] Hermann Schichl,et al. Interval Analysis on Directed Acyclic Graphs for Global Optimization , 2005, J. Glob. Optim..
[95] David A. McAllester. Partial Order Backtracking , 1993 .
[96] Joxan Jaffar,et al. Methodology and Implementation of a CLP System , 1987, ICLP.
[97] Boi Faltings,et al. Clustering for Disconnected Solution Sets of Numerical CSPs , 2003, CSCLP.
[98] Peter van Beek,et al. Local and Global Relational Consistency , 1995, Theor. Comput. Sci..
[99] Krzysztof R. Apt,et al. The Essence of Constraint Propagation , 1998, Theor. Comput. Sci..
[100] Eldon Hansen,et al. Bounding the solution of interval linear equations , 1992 .
[101] Luc Jaulin,et al. Applied Interval Analysis , 2001, Springer London.
[102] David A. McAllester,et al. GSAT and Dynamic Backtracking , 1994, KR.
[103] Eldon Hansen,et al. Global optimization using interval analysis , 1992, Pure and applied mathematics.
[104] A. Neumaier. Complete search in continuous global optimization and constraint satisfaction , 2004, Acta Numerica.
[105] Siegfried M. Rump,et al. A Note on Epsilon-Inflation , 1998, Reliab. Comput..
[106] R. Baker Kearfott,et al. The cluster problem in multivariate global optimization , 1994, J. Glob. Optim..
[107] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.
[108] A. Avizeinis,et al. Signed Digit Number Representations for Fast Parallel Arithmetic , 1961 .
[109] R. B. Kearfott,et al. Abstract generalized bisection and a cost bound , 1987 .
[110] J. J. McGregor. Relational consistency algorithms and their application in finding subgraph and graph isomorphisms , 1979, Inf. Sci..
[111] Kiyotaka Yamamura,et al. Finding all Solutions of Systems of Nonlinear Equations Using the Dual Simplex Method , 2002 .
[112] Boi Faltings,et al. Solving Mixed and Conditional Constraint Satisfaction Problems , 2003, Constraints.
[113] Marius-Calin Silaghi,et al. Numerical Constraint Satisfaction Problems with Non-isolated Solutions , 2002, COCOS.
[114] Siegfried M. Rump,et al. Solution of linear and nonlinear algebraic problems with sharp, guaranteed bounds , 1984 .
[115] Karl Nickel,et al. A GLOBALLY CONVERGENT BALL NEWTON METHOD , 1981 .
[116] W. Lodwick,et al. An improved unconstrained global optimization algorithm , 1996 .
[117] Rina Dechter,et al. Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..
[118] Garth P. McCormick,et al. Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..
[119] Khaled Omrani,et al. A 2002 update of the supplementary bibliography on roots of polynomials , 2002 .
[120] Arnold Neumaier,et al. The Krawczyk operator and Kantorovich's theorem , 1990 .
[121] A. Neumaier. Overestimation in linear interval equations , 1987 .
[122] William H. Press,et al. The Art of Scientific Computing Second Edition , 1998 .
[123] James E. Falk,et al. Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..
[124] V. Tikhomirov. On the Representation of Continuous Functions of Several Variables as Superpositions of Continuous Functions of one Variable and Addition , 1991 .
[125] Y. Cho,et al. Fixed Point Theory and Applications , 2000 .
[126] Arnold Neumaier,et al. Interval Newton operators for function strips , 1987 .
[127] E. Hansen. On solving systems of equations using interval arithmetic , 1968 .
[128] D K Smith,et al. Numerical Optimization , 2001, J. Oper. Res. Soc..
[129] John Gaschnig,et al. A General Backtrack Algorithm That Eliminates Most Redundant Tests , 1977, IJCAI.
[130] Joachim Gudmundsson,et al. Box-trees and R-trees with near-optimal query time , 2001, SCG '01.
[131] Eric Monfroy,et al. Declarative Modelling of Constraint Propagation Strategies , 2000, ADVIS.
[132] Pramila Srivastava,et al. Fixed Point Theory and Best Approximation: The KKM-map Principle , 1997 .
[133] Rudolf Krawczyk,et al. Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken , 1969, Computing.
[134] Arnold Neumaier,et al. Safe bounds in linear and mixed-integer linear programming , 2004, Math. Program..
[135] Pascal Van Hentenryck,et al. Numerica: A Modeling Language for Global Optimization , 1997, IJCAI.
[136] Rudolf Krawczyk. A class of interval-Newton-operators , 2005, Computing.
[137] R. Baker Kearfott,et al. Some tests of generalized bisection , 1987, TOMS.
[138] Edward P. K. Tsang,et al. Foundations of constraint satisfaction , 1993, Computation in cognitive science.
[139] Esther Gelle,et al. On the generation of locally consistent solution spaces in mixed dynamic constraint problems , 1998 .
[140] Eldon R. Hansen,et al. The Hull of Preconditioned Interval Linear Equations , 2000, Reliab. Comput..
[141] J. H. Wilkinson. The algebraic eigenvalue problem , 1966 .
[142] Ernest Davis,et al. Constraint Propagation with Interval Labels , 1987, Artif. Intell..
[143] Ralph R. Martin,et al. Comparison of interval methods for plotting algebraic curves , 2002, Comput. Aided Geom. Des..
[144] 山村 清隆,et al. Finding All Solutions of Nonlinear Equations Using the Dual Simplex Method (短期共同研究 精度保証付き数値計算法とその周辺) , 2000 .
[145] Marius-Calin Silaghi. Asynchronously solving distributed problems with privacy requirements , 2002 .
[146] Gerald Jay Sussman,et al. CONSTRAINTS - A Language for Expressing Almost-Hierarchical Descriptions , 1980, Artif. Intell..
[147] Yahia Lebbah,et al. A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations , 2002, CP.
[148] Frédéric Goualard,et al. Revising Hull and Box Consistency , 1999, ICLP.
[149] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[150] Peter J. Stuckey,et al. Programming with Constraints: An Introduction , 1998 .
[151] Matthew L. Ginsberg,et al. Limited Discrepancy Search , 1995, IJCAI.
[152] Hermann Schichl,et al. Exclusion Regions for Systems of Equations , 2004, SIAM J. Numer. Anal..
[153] Robert E. Mercer,et al. Minimal forward checking , 1994, Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94.
[154] Amir Pnueli,et al. Orthogonal Polyhedra: Representation and Computation , 1999, HSCC.
[155] G. Mayer. Epsilon-inflation with contractive interval functions , 1998 .
[156] Subhash Suri,et al. Analysis of a bounding box heuristic for object intersection , 1999, SODA '99.
[157] J. Stolfi,et al. Aane Arithmetic and Its Applications to Computer Graphics , 1990 .
[158] Olivier Lhomme,et al. Consistency Techniques for Numeric CSPs , 1993, IJCAI.
[159] Siegfried M. Rump,et al. Kleine Fehlerschranken bei Matrixproblemen , 1980 .
[160] Kurt Georg,et al. A new exclusion test , 2003 .
[161] Eric Monfroy,et al. Chaotic iteration for distributed constraint propagation , 1999, SAC '99.
[162] Kurt Georg,et al. Improving the efficiency of exclusion algorithms , 2001 .
[163] Hermann Schichl,et al. Using directed acyclic graphs to coordinate propagation and search for numerical constraint satisfaction problems , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.
[164] J. Garloff,et al. Solving strict polynomial inequalities by Bernstein expansion , 1999 .
[165] Frédéric Benhamou,et al. Progress in the Solving of a Circuit Design Problem , 2001, J. Glob. Optim..
[166] Eugene C. Freuder. A sufficient condition for backtrack-bounded search , 1985, JACM.
[167] Marius-Calin Silaghi,et al. Approximation Techniques for Non-linear Problems with Continuum of Solutions , 2002, SARA.
[168] Boi Faltings,et al. Consistency techniques for continuous constraints , 1996, Constraints.
[169] Michael J. Maher,et al. Logic Programming Language Scheme , 1986, Logic Programming: Functions, Relations, and Equations.
[170] J. McNamee. A bibliography on roots of polynomials , 1993 .
[171] Shinya Miyajima,et al. A New Dividing Method in Affine Arithmetic , 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[172] Eric Walter,et al. Set inversion via interval analysis for nonlinear bounded-error estimation , 1993, Autom..
[173] Djamila Sam-Haroud,et al. Path Consistency on Triangulated Constraint Graphs , 1999, IJCAI.
[174] Solomon W. Golomb,et al. Backtrack Programming , 1965, JACM.
[175] Pascal Van Hentenryck. A Gentle Introduction to NUMERICA , 1998, Artif. Intell..
[176] H. Penny Nii,et al. The Handbook of Artificial Intelligence , 1982 .
[177] J. Garloff,et al. Lower bound functions for polynomials , 2003 .
[178] Arnaud Gotlieb,et al. Dynamic Optimization of Interval Narrowing Algorithms , 1998, J. Log. Program..
[179] G. Mayer. Comparison theorems for iterative methods based on strong splittings , 1987 .
[180] Ramon E. Moore. Interval arithmetic and automatic error analysis in digital computing , 1963 .
[181] L. Jaulin,et al. Solution globale et garantie de problemes ensemblistes; applications a l'estimation non lineaire et a la commande robuste , 1994 .
[182] Vladik Kreinovich,et al. Solving Linear Interval Systems Is NP-Hard Even If We Exclude Overflow and Underflow , 1998, Reliab. Comput..
[183] Frédéric Messine,et al. Extentions of Affine Arithmetic: Application to Unconstrained Global Optimization , 2002, J. Univers. Comput. Sci..
[185] Pascal Van Hentenryck,et al. Safe and tight linear estimators for global optimization , 2005, Math. Program..
[186] Hélène Collavizza,et al. Extending Consistent Domains of Numeric CSP , 1999, IJCAI.
[187] Rina Dechter,et al. Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..
[188] Tomas Akenine-Möller,et al. Collision Detection for Continuously Deforming Bodies , 2001, Eurographics.
[189] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[190] Peter Kornerup,et al. Finite Precision Rational Arithmetic: Slash Number Systems , 1983, IEEE Transactions on Computers.
[191] E. R. Hansen. Preconditioning linearized equations , 2007, Computing.
[192] R. B. Kearfott,et al. A Comparison of some Methods for Solving Linear Interval Equations , 1997 .
[193] A. Neumaier,et al. Interval Slopes for Rational Functions and Associated Centered Forms , 1985 .
[194] G. McCormick. Nonlinear Programming: Theory, Algorithms and Applications , 1983 .
[195] Hartmut Schwandt. Iterative methods for systems of equations with interval coefficients and linear form , 2005, Computing.
[196] Yahia Lebbah,et al. Accelerating filtering techniques for numeric CSPs , 2002, Artif. Intell..
[197] Patrick Prosser,et al. HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..
[198] S. Rump. Verification methods for dense and sparse systems of equations , 1994 .
[199] Christian Jansson,et al. Convex-Concave Extensions , 2000 .
[200] Eric Monfroy,et al. Symbolic-interval cooperation in constraint programming , 2001, ISSAC '01.
[201] Webb Miller. More on quadratic convergence in interval arithmetic , 1973 .
[202] C. Lottaz. Collaborative design using solution spaces , 2000 .
[203] D. Struik. A concise history of mathematics , 1949 .
[204] Andrew J. Davenport,et al. GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement , 1994, AAAI.
[205] Laurent Granvilliers,et al. On the Combination of Interval Constraint Solvers , 2001, Reliab. Comput..
[206] Kiyotaka Yamamura. Finding All Solutions of Weakly Nonlinear Equations Using Linear Programming , 2000 .
[207] Eugene L. Allgower,et al. On the Complexity of Exclusion Algorithms for Optimization , 2002, J. Complex..
[208] Eugene C. Freuder. Synthesizing constraint expressions , 1978, CACM.
[209] Frédéric Goualard,et al. Universally Quantified Interval Constraints , 2000, CP.
[210] Frédéric Benhamou,et al. Automatic Generation of Numerical Redundancies for Non-Linear Constraint Solving , 1997, Reliab. Comput..
[211] Eugene C. Freuder,et al. Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.
[212] K. Nickel. On the Newton Method in Interval Analysis , 1971 .
[213] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[214] Arnold Neumaier,et al. Taylor Forms—Use and Limits , 2003, Reliab. Comput..
[215] Jürgen Herzberger,et al. ALGOL-60 Algorithmen zur Auflösung linearer Gleichungssysteme mit Fehlererfassung , 1970, Computing.
[216] F. A. Seiler,et al. Numerical Recipes in C: The Art of Scientific Computing , 1989 .
[217] Ch. Bliek. Generalizing Dynamic and Partial Order Backtracking , 1998, AAAI 1998.
[218] E. R. Hansen,et al. A Generalized Interval Arithmetic , 1975, Interval Mathematics.
[219] Avron Barr,et al. The Handbook of Artificial Intelligence , 1982 .
[220] Nicolas Monmarché,et al. A new clustering algorithm based on the chemical recognition system of ants , 2002 .
[221] David A. McAllester,et al. Solving Polynomial Systems Using a Branch and Prune Approach , 1997 .
[222] G. Mayer. Enclosing the solutions of systems of linear equations by interval iterative processes , 1988 .
[223] Jiang-She Zhang,et al. A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions , 1997 .
[224] Lubomir V. Kolev. Automatic Computation of a Linear Interval Enclosure , 2001, Reliab. Comput..