標(biāo)題: Titlebook: Integration of Constraint Programming, Artificial Intelligence, and Operations Research; 18th International C Peter J. Stuckey Conference p [打印本頁] 作者: interleukins 時(shí)間: 2025-3-21 18:15
書目名稱Integration of Constraint Programming, Artificial Intelligence, and Operations Research影響因子(影響力)
書目名稱Integration of Constraint Programming, Artificial Intelligence, and Operations Research影響因子(影響力)學(xué)科排名
書目名稱Integration of Constraint Programming, Artificial Intelligence, and Operations Research網(wǎng)絡(luò)公開度
書目名稱Integration of Constraint Programming, Artificial Intelligence, and Operations Research網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Integration of Constraint Programming, Artificial Intelligence, and Operations Research被引頻次
書目名稱Integration of Constraint Programming, Artificial Intelligence, and Operations Research被引頻次學(xué)科排名
書目名稱Integration of Constraint Programming, Artificial Intelligence, and Operations Research年度引用
書目名稱Integration of Constraint Programming, Artificial Intelligence, and Operations Research年度引用學(xué)科排名
書目名稱Integration of Constraint Programming, Artificial Intelligence, and Operations Research讀者反饋
書目名稱Integration of Constraint Programming, Artificial Intelligence, and Operations Research讀者反饋學(xué)科排名
作者: 胎兒 時(shí)間: 2025-3-21 21:00
A Computational Study of Constraint Programming Approaches for Resource-Constrained Project Schedulduling problems where the duration of activities can be reduced when scheduled after certain other activities that allow for learning relevant skills. Since per-period availabilities of renewable resources are limited and precedence requirements have to be respected, the resulting optimization probl作者: 真實(shí)的人 時(shí)間: 2025-3-22 03:00
Strengthening of Feasibility Cuts in Logic-Based Benders Decomposition,ack information. Therefore, an important acceleration technique in LBBD is to strengthen feasibility cuts by reducing their sizes. This is typically done by solving additional subproblems to evaluate potential cuts. In this paper, we study three cut-strengthening algorithms that differ in the comput作者: 歪曲道理 時(shí)間: 2025-3-22 04:43 作者: Cuisine 時(shí)間: 2025-3-22 11:52
A,-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem,relies on the compilation of a relaxed multi-valued decision diagram (MDD) in a special way that is based on the principles of A. search. An extensive experimental evaluation on several standard LCS benchmark instance sets shows that the novel construction algorithm clearly outperforms a traditional作者: Stagger 時(shí)間: 2025-3-22 16:04
Partitioning Students into Cohorts During COVID-19,s. One of the most effective measures to reduce virus transmission is partitioning students into discrete cohorts..In primary and middle schools, it is easy to create these cohorts (also known as “l(fā)earning groups”), since students in each grade take the same set of required courses. However, in high作者: 威脅你 時(shí)間: 2025-3-22 20:18 作者: Enervate 時(shí)間: 2025-3-22 22:30
Heavy-Tails and Randomized Restarting Beam Search in Goal-Oriented Neural Sequence Decoding,oblems. In these scenarios, the beam search algorithm is typically used to produce a set of high-likelihood candidate sequences that are evaluated to determine if they satisfy the goal criteria. If none of the candidates satisfy the criteria, the beam search can be restarted with a larger beam size 作者: 貪婪的人 時(shí)間: 2025-3-23 05:18 作者: 惡名聲 時(shí)間: 2025-3-23 09:32 作者: 使高興 時(shí)間: 2025-3-23 11:52
Towards a Compact SAT-Based Encoding of Itemset Mining Tasks,own declarative AI models, the problem is encoded as a constraints network or a propositional formula, whose associated models correspond to the patterns of interest. In this new declarative framework, new user-specified constraints can be easily integrated, while in traditional data mining, such ad作者: 褪色 時(shí)間: 2025-3-23 15:08
,A Pipe Routing Hybrid Approach Based on A-Star Search and?Linear Programming, is to connect an input configuration to an output configuration by using a pipe composed of a succession of straight sections and bends. The pipe is routed within a 3D continuous space divided into non-regular convex cells in order to take obstacles into account. Our objective is to consider severa作者: 原諒 時(shí)間: 2025-3-23 18:51 作者: 使乳化 時(shí)間: 2025-3-24 01:35
,Two Deadline Reduction Algorithms for?Scheduling Dependent Tasks on?Parallel Processors,s on a limited number of processors. This decision problem is denoted by . in standard notations. The first technique is an extension of the Garey and Johnson algorithm that integrates precedence relations in energetic reasoning. The second one is an extension of the Leung, Palem and Pnueli algorith作者: 并入 時(shí)間: 2025-3-24 04:23 作者: 發(fā)電機(jī) 時(shí)間: 2025-3-24 09:45 作者: Hdl348 時(shí)間: 2025-3-24 14:10
Injecting Domain Knowledge in Neural Networks: A Controlled Experiment on a Constrained Problem, problems with implicit soft and hard constraints. In this paper, we consider a setup where one has offline access to symbolic, incomplete, problem knowledge, which cannot however be employed at search time. We show how such knowledge can be generally treated as a propagator, we devise an approach t作者: 盡責(zé) 時(shí)間: 2025-3-24 18:28
Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems,thin a short time while minimizing costs. In this work, we consider the short-horizon planning of a problem variant where every order has to be delivered with the goal to minimize delivery tardiness, travel times, and labor costs of the drivers involved. Stochastic information as spatial and tempora作者: malapropism 時(shí)間: 2025-3-24 23:05 作者: 向外供接觸 時(shí)間: 2025-3-25 03:05 作者: insurrection 時(shí)間: 2025-3-25 06:40
Integration of Constraint Programming, Artificial Intelligence, and Operations Research978-3-030-78230-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 獸群 時(shí)間: 2025-3-25 10:19
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/i/image/468832.jpg作者: dialect 時(shí)間: 2025-3-25 13:59
https://doi.org/10.1007/978-3-030-78230-6artificial intelligence; communication systems; computer hardware; computer networks; computer programmi作者: Factual 時(shí)間: 2025-3-25 19:12
Between Steps: Intermediate Relaxations Between Big-M and Convex Hull Formulations,ts show that the intermediate .-split formulations can form strong outer approximations of the convex hull with fewer variables and constraints than the extended convex hull formulations, giving significant computational advantages over both the big-M and convex hull.作者: Diverticulitis 時(shí)間: 2025-3-25 20:23
0302-9743 Intelligence, and Operations Research, CPAIOR 2021, which was held in Vienna, Austria, in 2021. Due to the COVID-19 pandemic the conference was held online.?The 30 regular papers presented were carefully reviewed and selected from a total of 75 submissions. The conference program included a Master C作者: exostosis 時(shí)間: 2025-3-26 01:38 作者: Inflammation 時(shí)間: 2025-3-26 08:02 作者: 和音 時(shí)間: 2025-3-26 10:53
The Traveling Social Golfer Problem: The Case of the Volleyball Nations League,omposition approach for the resulting optimization problem, leading to the so-called Venue Assignment Problem. Using integer programming methods, we find, for real-life instances, the fairest schedules with respect to the difference in travel distance.作者: homeostasis 時(shí)間: 2025-3-26 15:57 作者: 貨物 時(shí)間: 2025-3-26 18:12 作者: tariff 時(shí)間: 2025-3-27 00:03
Conference proceedings 2021 30 regular papers presented were carefully reviewed and selected from a total of 75 submissions. The conference program included a Master Class on the topic "Explanation and Verification of Machine Learning Models"..作者: 心神不寧 時(shí)間: 2025-3-27 03:35 作者: 卷發(fā) 時(shí)間: 2025-3-27 08:17 作者: 最低點(diǎn) 時(shí)間: 2025-3-27 09:43 作者: Magisterial 時(shí)間: 2025-3-27 16:10 作者: Needlework 時(shí)間: 2025-3-27 18:32 作者: Stagger 時(shí)間: 2025-3-28 00:51
Alessandro Hill,Jordan Ticktin,Thomas W. M. Vossen作者: Enteropathic 時(shí)間: 2025-3-28 02:10
Keliang Wang,Leonardo Lozano,David Bergman,Carlos Cardonha作者: 平淡而無味 時(shí)間: 2025-3-28 09:07
Christian Klanke,Dominik R. Bleidorn,Vassilios Yfantis,Sebastian Engell作者: Devastate 時(shí)間: 2025-3-28 13:40 作者: 態(tài)度暖昧 時(shí)間: 2025-3-28 17:17
Ikram Nekkache,Said Jabbour,Lakhdar Sais,Nadjet Kamel作者: 食道 時(shí)間: 2025-3-28 22:49
Marvin Stanczak,Cédric Pralet,Vincent Vidal,Vincent Baudoui作者: PLIC 時(shí)間: 2025-3-28 23:51 作者: Notify 時(shí)間: 2025-3-29 03:53 作者: painkillers 時(shí)間: 2025-3-29 08:03
A Computational Study of Constraint Programming Approaches for Resource-Constrained Project Schedulo devise a destructive lower bounding method. We perform an extensive computational study across thousands of instances based on the PSPlib to quantify the impact of project size, potential learning occurrences, and learning effects on the optimal project duration. In addition, we compare formulatio作者: 吸引人的花招 時(shí)間: 2025-3-29 12:50
Strengthening of Feasibility Cuts in Logic-Based Benders Decomposition, obtain irreducible cuts. In particular, the use of the depth-first binary search cut-strengthening algorithm gives a good performance. Another observation is that when the subproblem can be separated into small independent problems, the impact of cut strengthening is dominated by that of the separa作者: Brain-Waves 時(shí)間: 2025-3-29 16:03 作者: Deadpan 時(shí)間: 2025-3-29 23:01
Partitioning Students into Cohorts During COVID-19,ses. We solve this problem by modeling it as an integer linear program, and apply our model to generate the Master Timetable for a Canadian all-boys high school, successfully enrolling students in 87% of their desired courses, including 100% of their required courses. We conclude the paper by explai作者: DALLY 時(shí)間: 2025-3-30 02:10
Heavy-Tails and Randomized Restarting Beam Search in Goal-Oriented Neural Sequence Decoding,we propose a randomized restarting variant of beam search. We conduct extensive empirical evaluation, comparing different randomization techniques and restart strategies, and show that the randomized restarting variant solves some of the hardest instances faster and outperforms the baseline.作者: evaculate 時(shí)間: 2025-3-30 08:03
,Combining Constraint Programming and?Temporal Decomposition Approaches - Scheduling of an Industriaall instances of the scheduling problem monolithically. To deal with large instances a decomposition algorithm is developed. The overall set of batches is divided into subsets which are scheduled iteratively. The algorithm is designed in a moving horizon fashion, in order to counteract the disadvant作者: 漫不經(jīng)心 時(shí)間: 2025-3-30 10:45
Towards a Compact SAT-Based Encoding of Itemset Mining Tasks,lowing us to reduce considerably the size of the encoding while improving the pattern enumeration step. Finally, we provide experimental evidence that our proposed approach achieves a significant reduction in the size of the encoding. These results show interesting improvements of this compact SAT-b作者: 戲服 時(shí)間: 2025-3-30 15:56
,A Pipe Routing Hybrid Approach Based on A-Star Search and?Linear Programming,est path problem in the space of routing plans, where a routing plan is specified by the parts composing a pipe and by geometrical constraints imposed on these parts. The problem is then solved using weighted A* search combined with a linear program that quickly evaluates the feasibility and the cos作者: 兒童 時(shí)間: 2025-3-30 19:32 作者: 割公牛膨脹 時(shí)間: 2025-3-30 22:04
On the Usefulness of Linear Modular Arithmetic in Constraint Programming, an efficient and scalable way to handle linear modular constraints. On the theoretical side, we remark on the pairwise independence offered by hash functions based on linear modular constraints, and then discuss the design of hashing-based model counters for ., supported by empirical results showin作者: Cirrhosis 時(shí)間: 2025-3-31 01:49 作者: 啤酒 時(shí)間: 2025-3-31 05:49 作者: 吞噬 時(shí)間: 2025-3-31 09:32 作者: Intend 時(shí)間: 2025-3-31 15:13 作者: –DOX 時(shí)間: 2025-3-31 18:51 作者: ITCH 時(shí)間: 2025-3-31 22:47 作者: Optic-Disk 時(shí)間: 2025-4-1 03:51
Chitranjan Kumar,Vipin Kumary stem from their earlier frustrating encounters with it. vii viii PREFACE This book will show these readers that these fears, frustrations, and general antipathy are unwarranted, for, as stated, it is not a textbook full of long, boring proofs and hundreds of problems, rather it is an intellectual adventure,978-1-4899-2774-3作者: Limerick 時(shí)間: 2025-4-1 05:59 作者: cortisol 時(shí)間: 2025-4-1 11:06 作者: 極端的正確性 時(shí)間: 2025-4-1 15:32
Introduction: From Location and Space Economics to Spatial Dynamics significant contribution in the location and allocation (L-A) modelling of economic, social and political activities. This development has taken place in two distinctly separate directions. The first is in the discipline of operations research where the location-allocation models have been applied 作者: periodontitis 時(shí)間: 2025-4-1 22:23 作者: 不能和解 時(shí)間: 2025-4-2 02:43
