LEADER 01809nlm0 22005051i 450 001 990009241850403321 010 $a9783540741985 035 $a000924185 035 $aFED01000924185 035 $a(Aleph)000924185FED01 035 $a000924185 100 $a20100926d2007----km-y0itay50------ba 101 0 $aeng 102 $aDE 135 $adrnn-008mamaa 200 1 $aEnergy Minimization Methods in Computer Vision and Pattern Recognition$bRisorsa elettronica$e6th International Conference, EMMCVPR 2007, Ezhou, China, August 27-29, 2007. Proceedings$fedited by Alan L. Yuille, Song-Chun Zhu, Daniel Cremers 210 $aBerlin ; Heidelberg$cSpringer$d2007 225 1 $aLecture Notes in Computer Science$x0302-9743$v4679 230 $aDocumento elettronico 336 $aTesto 337 $aFormato html, pdf 702 1$aCremers,$bDaniel 702 1$aWang,$bYongtian 702 1$aYuille,$bAlan L. 702 1$aZhu,$bSong-Chun 801 0$aIT$bUNINA$gREICAT$2UNIMARC 856 4 $zFull text per gli utenti Federico II$uhttp://dx.doi.org/10.1007/978-3-540-74198-5 901 $aEB 912 $a990009241850403321 961 $aAlgorithm Analysis and Problem Complexity 961 $aArtificial intelligence 961 $aArtificial Intelligence (incl. Robotics) 961 $aComputer graphics 961 $aComputer Graphics 961 $aComputer science 961 $aComputer Science 961 $aComputer software 961 $aComputer vision 961 $aData mining 961 $aData Mining and Knowledge Discovery 961 $aImage Processing and Computer Vision 961 $aOptical pattern recognition 961 $aPattern Recognition 996 $aEnergy Minimization Methods in Computer Vision and Pattern Recognition$9772370 997 $aUNINA LEADER 07019nam 22007695 450 001 9910349435103321 005 20251225203710.0 010 $a9783319930312 010 $a3319930311 024 7 $a10.1007/978-3-319-93031-2 035 $a(CKB)3810000000358663 035 $a(DE-He213)978-3-319-93031-2 035 $a(MiAaPQ)EBC6283559 035 $a(PPN)22949434X 035 $a(EXLCZ)993810000000358663 100 $a20180607d2018 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aIntegration of Constraint Programming, Artificial Intelligence, and Operations Research $e15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26?29, 2018, Proceedings /$fedited by Willem-Jan van Hoeve 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (XXVI, 616 p. 155 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10848 311 08$a9783319930305 311 08$a3319930303 320 $aIncludes bibliographical references and index. 327 $aTime-bounded Query Generator for Constraint Acquisition -- Propagating lex, Find and Replace with Dashed Strings -- Designing Fair, Effcient, and Interpretable Policies for Prioritizing Homeless Youth for Housing Resources -- An Efficient Relaxed Projection Method for Constrained Non-negative Matrix Factorization with Application to the Phase-Mapping Problem in Materials Science -- Dealing with Demand Uncertainty in Service Network and Load Plan Design -- Energy-Aware Production Scheduling with Power-Saving Modes -- Episode Support: A Global Constraint for Mining Frequent Patterns in A Long Sequence of Events -- Off-line and on-line Optimization Under Uncertainty: A Case Study on Energy Management -- Reasoning on Sequences in Constraint-Based Local Search Frameworks -- Guiding Constraint Programming with Hot Starts for High School Timetabling -- Epiphytic Trees: Relational Consistency Applied to Global Optimization Problems -- Learning Heuristics for the TSP by Policy Gradient -- Three-Dimensional Matching Instances Are Rich in Stable Matchings -- From Backdoor Key to Backdoor Completability: Improving a Known Measure of Hardness for the Satisfiable CSP -- Constrained-based Differential Privacy: Releasing Optimal Power Flow Benchmarks Privately -- Chasing First Queens by Integer Programming -- Accelerating Counting-Based Search -- Model Agnostic Solution of CSPs via Deep Learning: A Preliminary Study -- Boosting Efficiency for Computing the Pareto Frontier on Tree Structured Networks -- Bandits Help Simulated Annealing to Complete a Maximin Latin Hypercube Design -- A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem -- Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms -- Horizontally Elastic Not-First/Not-Last Filtering Algorithm for Cumulative Resource Constraint -- Soft-regular with a Prefix-size Violation Measure -- Constraint and Mathematical Programming for Integrated Port Container Terminal Operations -- Heuristic Variants for A* Search in 3D Flight Planning -- Juniper: An Open-Source Nonlinear Branch-and-Bound Solver in Julia -- Objective Landscapes for Constraint Programming -- An Update on the Comparison of MIP, CP and Hybrid Approaches for Mixed Resource Allocation and Scheduling -- Modeling and Solving the Senior Transportation Problem -- Solver Independent Rotating Workforce Scheduling -- Greedy Randomized Search for Scalable Compilation of Quantum Circuits -- A Comparison of Optimization Methods for Multi-Objective Constrained Bin Packing Problems -- A O(n log^2 n) Checker and O(n^2 log n) Filtering Algorithm for the Energetic Reasoning -- The Weighted Circuits LMax Constraint -- A Local Search Framework for Compiling Relaxed Decision Diagrams -- Symmetry Breaking Inequalities from the Schreier-Sims table -- Frequency-based Multi-agent Patrolling Model and Its Area Partitioning Solution Method for Balanced Workload -- Algorithms for Sparse k-Monotone Regression -- Revisiting the Self-Adaptive Large Neighbourhood Search -- A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs -- Symbolic Bucket Elimination for Piecewise Continuous Constrained Optimization -- Learning a Classification of Mixed-Integer Quadratic Programming Problems -- Fleet Scheduling in Underground Mines using Constraint Programming. 330 $aThis book constitutes the proceedings of the 15th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2018, held in Delft, The Netherlands, in June 2018. The 47 full papers presented together with 3 abstracts of invited talks and 3 abstracts of fast-track journal papers were carefully reviewed and selected from 111 submissions. The conference brings together interested researchers from constraint programming, artificial intelligence, and operations research to present new techniques or applications in the intersection of these fields and provides an opportunity for researchers in one area to learn about techniques in the others, and to show how the integration of techniques from different fields can lead to interesting results on large and complex problems. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10848 606 $aNumerical analysis 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence 606 $aAlgorithms 606 $aOperating systems (Computers) 606 $aArtificial intelligence$xData processing 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 606 $aArtificial Intelligence 606 $aAlgorithms 606 $aOperating Systems 606 $aData Science 615 0$aNumerical analysis. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence. 615 0$aAlgorithms. 615 0$aOperating systems (Computers). 615 0$aArtificial intelligence$xData processing. 615 14$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aArtificial Intelligence. 615 24$aAlgorithms. 615 24$aOperating Systems. 615 24$aData Science. 676 $a005.11 702 $avan Hoeve$b Willem-Jan$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910349435103321 996 $aIntegration of Constraint Programming, Artificial Intelligence, and Operations Research$92880461 997 $aUNINA