Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Continuous and interval constraints
F Benhamou, L Granvilliers - Foundations of Artificial Intelligence, 2006 - Elsevier
Publisher Summary This chapter reviews that continuous constraint solving has been widely
studied in several fields of applied mathematics and computer science. In computer algebra …
studied in several fields of applied mathematics and computer science. In computer algebra …
Constraint programming
F Rossi, P Van Beek, T Walsh - Foundations of Artificial Intelligence, 2008 - Elsevier
Publisher Summary Constraint programming is a powerful paradigm for solving
combinatorial search problems that draws on a wide range of techniques from artificial …
combinatorial search problems that draws on a wide range of techniques from artificial …
[КНИГА][B] Introduction to interval analysis
This book is intended primarily for those not yet familiar with methods for computing with
intervals of real numbers and what can be done with these methods. Using a pair [a, b] of …
intervals of real numbers and what can be done with these methods. Using a pair [a, b] of …
[КНИГА][B] Interval analysis
Before using interval analysis as a basic tool in the following chapters, we shall now
introduce its main concepts. Section 2.2 recalls fundamental notions on set operators, set …
introduce its main concepts. Section 2.2 recalls fundamental notions on set operators, set …
[КНИГА][B] Handbook of constraint programming
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …
that draws on a wide range of techniques from artificial intelligence, computer science …
[КНИГА][B] Global optimization using interval analysis: revised and expanded
E Hansen, GW Walster - 2003 - books.google.com
Employing a closed set-theoretic foundation for interval computations, Global Optimization
Using Interval Analysis simplifies algorithm construction and increases generality of interval …
Using Interval Analysis simplifies algorithm construction and increases generality of interval …
Branching and bounds tighteningtechniques for non-convex MINLP
Many industrial problems can be naturally formulated using mixed integer non-linear
programming (MINLP) models and can be solved by spatial Branch&Bound (sBB) …
programming (MINLP) models and can be solved by spatial Branch&Bound (sBB) …
[КНИГА][B] Handbook of knowledge representation
Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
[КНИГА][B] Shape interrogation for computer aided design and manufacturing
NM Patrikalakis, T Maekawa - 2002 - Springer
Shape interrogation is the process of extraction of information from a geometric model. It is a
fundamental component of Computer Aided Design and Manufacturing (CAD/CAM) …
fundamental component of Computer Aided Design and Manufacturing (CAD/CAM) …
[PDF][PDF] Solving mixed-integer quadratic programming problems with IBM-CPLEX: a progress report
Solving Mixed-Integer Quadratic Programming problems with IBM-CPLEX: a progress report
Page 1 Proceedings of the Twenty-Sixth RAMP Symposium Hosei University, Tokyo, October …
Page 1 Proceedings of the Twenty-Sixth RAMP Symposium Hosei University, Tokyo, October …