標(biāo)題: Titlebook: Learning and Intelligent Optimization; 13th International C Nikolaos F. Matsatsinis,Yannis Marinakis,Panos Par Conference proceedings 2020 [打印本頁(yè)] 作者: 矜持 時(shí)間: 2025-3-21 16:12
書(shū)目名稱(chēng)Learning and Intelligent Optimization影響因子(影響力)
書(shū)目名稱(chēng)Learning and Intelligent Optimization影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Learning and Intelligent Optimization網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Learning and Intelligent Optimization網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Learning and Intelligent Optimization被引頻次
書(shū)目名稱(chēng)Learning and Intelligent Optimization被引頻次學(xué)科排名
書(shū)目名稱(chēng)Learning and Intelligent Optimization年度引用
書(shū)目名稱(chēng)Learning and Intelligent Optimization年度引用學(xué)科排名
書(shū)目名稱(chēng)Learning and Intelligent Optimization讀者反饋
書(shū)目名稱(chēng)Learning and Intelligent Optimization讀者反饋學(xué)科排名
作者: 大炮 時(shí)間: 2025-3-21 23:04 作者: 羽飾 時(shí)間: 2025-3-22 02:56
Towards Improving Merging Heuristics for Binary Decision Diagrams, multigraphs and represent the solution space of binary optimization problems in a recursive way. During their construction, merging of nodes in this multigraph is applied to keep the size within polynomial bounds resulting in a discrete relaxation of the original problem. The longest path length th作者: 物種起源 時(shí)間: 2025-3-22 06:00
On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line,racluster sums of the squared distances between clusters elements and their centers. The centers of some clusters are given as an input, while the other centers are unknown and defined as centroids (geometrical centers). It is known that the general case of the problem is strongly NP-hard. We show t作者: 昏暗 時(shí)間: 2025-3-22 12:38 作者: 冰河期 時(shí)間: 2025-3-22 14:33 作者: 證明無(wú)罪 時(shí)間: 2025-3-22 20:16 作者: DEFT 時(shí)間: 2025-3-22 21:45
A Hessian Free Neural Networks Training Algorithm with Curvature Scaled Adaptive Momentum, (HF-CSAM). The algorithm’s weight update rule is similar to SGD with momentum but with two main differences arising from the formulation of the training task as a constrained optimization problem: (i) the momentum term is scaled with curvature information (in the form of the Hessian); (ii) the coef作者: 流眼淚 時(shí)間: 2025-3-23 02:21
Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop,f any two bins is larger than the bin capacity. There is a trivial upper bound on the optimum in terms of the total size of the items. We refer to the decision version of this problem with the number of bins equal to the trivial upper bound as Irreducible Bin Packing. We prove that this problem is N作者: 存在主義 時(shí)間: 2025-3-23 08:49
Learning Probabilistic Constraints for Surgery Scheduling Using a Support Vector Machine,od for tackling probabilistic constraints using machine learning. The technique is inspired by models that use slacks in capacity planning. Essentially support vector classification is used to learn a linear constraint that will replace the probabilistic constraint. The data used to learn this const作者: 松果 時(shí)間: 2025-3-23 21:06
A RAMP Algorithm for Large-Scale Single Source Capacitated Facility Location Problems,LP). This problem considers a set of possible locations for opening facilities and a set of clients whose demand must be satisfied. The objective is to minimize the cost of assigning the clients to the facilities, ensuring that all clients are served by only one facility without exceeding the capaci作者: 北極熊 時(shí)間: 2025-3-24 01:18
A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems,reover, space inside cities for parking individual vehicles for movement is scarce and is becoming even scarcer. Thus, the need for a greener means of transportation and less individual vehicles inside the cities is demanded and rising. An already accepted and established solution possibility to the作者: 厭惡 時(shí)間: 2025-3-24 03:53
Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inpy to visit all the vertices. Given the edge costs and a certain profit associated with each vertex, the goal is to find a route which satisfies maximum collected profit and minimum traveling costs constraints. We show polynomial-time approximation algorithms for two variants of the problem and estab作者: menopause 時(shí)間: 2025-3-24 08:26 作者: 制定法律 時(shí)間: 2025-3-24 12:55
PTAS for the Euclidean Capacitated Vehicle Routing Problem with Time Windows,cations in operations research. Unlike the classic CVRP (without time windows constraints), approximability of the CVRPTW (even in the Euclidean plane) in the class of algorithms with theoretical guarantees is much less studied. To the best of our knowledge, the family of such algorithms is exhauste作者: cogent 時(shí)間: 2025-3-24 15:27 作者: 簡(jiǎn)潔 時(shí)間: 2025-3-24 21:36 作者: etiquette 時(shí)間: 2025-3-25 00:10
Vincenco Cutello,Maria Oliva,Mario Pavone,Rocco A. Scollopean context, focusing on solving the problems that can be found in an international environment, and that can be subject to regulation(s) addressing the user data confidentiality. Currently, user identification and authentication are the key enablers for Internet business but until now the user’s p作者: 碌碌之人 時(shí)間: 2025-3-25 04:48 作者: 鍍金 時(shí)間: 2025-3-25 09:12
Nikolaus Frohner,Günther R. Raidle Web 2.0 applications where the users cruise through the world with their individually shaped avatars to find either amusement, challenges or the next best business deal. People do invest a lot of time but beyond they invest in buying virtual assets like fantasy witcheries, wepaons, armour, houses,作者: PLAYS 時(shí)間: 2025-3-25 15:03
Alexander Kel’manov,Vladimir Khandeevowerfully and with high public visibility reactions in public to justify the power of technology in the interests of national security. The new goal is to search terrorist activity in the ocean of telecommunications data retained by communications providers and accessed by intelligence authorities. 作者: 使絕緣 時(shí)間: 2025-3-25 19:42
Ludwig Kampel,Michael Wagner,Ilias S. Kotsireas,Dimitris E. Simose Web 2.0 applications where the users cruise through the world with their individually shaped avatars to find either amusement, challenges or the next best business deal. People do invest a lot of time but beyond they invest in buying virtual assets like fantasy witcheries, wepaons, armour, houses,作者: AFFIX 時(shí)間: 2025-3-25 23:41 作者: eczema 時(shí)間: 2025-3-26 03:51 作者: Abrupt 時(shí)間: 2025-3-26 06:17 作者: A精確的 時(shí)間: 2025-3-26 09:43 作者: DOSE 時(shí)間: 2025-3-26 15:59
Thomas Philip Runarssonand how to avoid some classic pitfalls..ERP systems continue to gain importance in the developed world, and while there are many alternatives to choose from (including competitive vendors as well as OpenSource projects such as Compierre), SAP is a major force in this field. Over the years SAP establ作者: rods366 時(shí)間: 2025-3-26 17:04
Alexander Kel’manov,Sergey Khamidullin,Anna Panasenkoe inter-disciplinary discussion of how to adequately secure electronic business processes. .The topics include: .- Economics of Security and Identity Management.- Security Services and Large Scale Public Applications.- Privacy and Data Protection and Awareness Raising.- Standards and Technical Solut作者: collateral 時(shí)間: 2025-3-26 22:26 作者: accomplishment 時(shí)間: 2025-3-27 03:33 作者: Infelicity 時(shí)間: 2025-3-27 06:19 作者: 職業(yè)拳擊手 時(shí)間: 2025-3-27 12:16 作者: HPA533 時(shí)間: 2025-3-27 13:42 作者: infantile 時(shí)間: 2025-3-27 18:45 作者: CULP 時(shí)間: 2025-3-28 01:00
Michael Khachay,Yuri Ogorodnikovity, reliability and flexibility of the power grid. Technology has been added from the consumer premise which includes appliances, thermostats, home energy managers and load control switches all the way back to the generation facilities. The combination of these technologies could potentially optimi作者: ARM 時(shí)間: 2025-3-28 02:43
Panagiotis Kalatzantonakis,Angelo Sifaleras,Nikolaos Samarasity, reliability and flexibility of the power grid. Technology has been added from the consumer premise which includes appliances, thermostats, home energy managers and load control switches all the way back to the generation facilities. The combination of these technologies could potentially optimi作者: arousal 時(shí)間: 2025-3-28 08:46
0302-9743 and selected from 52 submissions. The papers focus on advancedresearch developments in such interconnected fields as mathematical programming, global optimization, machine learning, and artificial intelligence and?describe advanced ideas, technologies, methods, and applications in optimization and 作者: 微塵 時(shí)間: 2025-3-28 13:54
Learning Probabilistic Constraints for Surgery Scheduling Using a Support Vector Machine,set. The linear support vector classifier is then updated during search, until a feasible solution is discovered. The stochastic surgery model presented is inspired by real challenges faced by many hospitals today and tested on real-life data.作者: 荒唐 時(shí)間: 2025-3-28 17:16 作者: Magnificent 時(shí)間: 2025-3-28 20:51
Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop,b aggregation at some node of a transportation network can be seen as an instance of a bin packing problem. We show that for a two-machine case a positive answer to the Irreducible Bin Packing problem question at some node leads to a linear algorithm of constructing an optimal schedule subject to some restrictions on the location of that node.作者: 酷熱 時(shí)間: 2025-3-29 01:12
Exact Algorithm for One Cardinality-Weighted 2-Partitioning Problem of a Sequence,ounded from above and below by given some constants. It is shown that the considered problem is the strongly NP-hard one. An exact algorithm is proposed for the case of integer-valued input of the problem. This algorithm has a pseudopolynomial running time if the space dimension is fixed.作者: 階層 時(shí)間: 2025-3-29 03:37
PTAS for the Euclidean Capacitated Vehicle Routing Problem with Time Windows, remain PTAS for slow-growing dependencies . and .. In this paper, combining the well-known instance decomposition framework by A.?Adamaszek et al. and QPTAS by L.?Song et al. we propose a novel approximation scheme for the planar CVRPTW, whose running time remains polynomial for the significantly wider range of . and ..作者: 性冷淡 時(shí)間: 2025-3-29 10:43 作者: Indicative 時(shí)間: 2025-3-29 12:10
Adaptive GVNS Heuristics for Solving the Pollution Location Inventory Routing Problem,d Search versions, illustrates the effectiveness of the intelligent mechanism used for automating the re-ordering of the local search operators in the improvement step of each optimization method. Results on 20 PLIRP benchmark instances show the efficiency of the proposed metaheuristics.作者: 制造 時(shí)間: 2025-3-29 18:49
Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inpm collected profit and minimum traveling costs constraints. We show polynomial-time approximation algorithms for two variants of the problem and establish conditions under which the presented algorithms are asymptotically optimal on random inputs.作者: LIKEN 時(shí)間: 2025-3-29 19:49
0302-9743 optimization, machine learning, and artificial intelligence and?describe advanced ideas, technologies, methods, and applications in optimization and machine learning..978-3-030-38628-3978-3-030-38629-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: nocturnal 時(shí)間: 2025-3-30 03:25 作者: 評(píng)論性 時(shí)間: 2025-3-30 06:58 作者: Entirety 時(shí)間: 2025-3-30 11:57
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/582888.jpg作者: overbearing 時(shí)間: 2025-3-30 13:59
978-3-030-38628-3Springer Nature Switzerland AG 2020作者: Bridle 時(shí)間: 2025-3-30 18:14 作者: 填滿(mǎn) 時(shí)間: 2025-3-31 00:46
https://doi.org/10.1007/978-3-030-38629-0artificial intelligence; combinatorial optimization; communication systems; computer networks; computer 作者: 野蠻 時(shí)間: 2025-3-31 02:35 作者: 滔滔不絕的人 時(shí)間: 2025-3-31 07:03
Vincenco Cutello,Maria Oliva,Mario Pavone,Rocco A. Scolloice providers, through the adequate service agreements, allowing them to share user information. The Fidelity Project implements an interoperability proof of concept in a pan-European context of the Liberty Alliance protocols and framework by setting up 4 CoT in four different EU countries. Each CoT作者: FLUSH 時(shí)間: 2025-3-31 13:00
Pierre Miasnikof,Liudmila Prokhorenkova,Alexander Y. Shestopaloff,Andrei Raigorodskiiice providers, through the adequate service agreements, allowing them to share user information. The Fidelity Project implements an interoperability proof of concept in a pan-European context of the Liberty Alliance protocols and framework by setting up 4 CoT in four different EU countries. Each CoT作者: pancreas 時(shí)間: 2025-3-31 13:21 作者: Friction 時(shí)間: 2025-3-31 20:42 作者: 揉雜 時(shí)間: 2025-3-31 23:16 作者: Complement 時(shí)間: 2025-4-1 05:36
óscar Oliveira,Telmo Matos,Dorabela Gamboa, but on the other hand today there are several handicaps leading to high complexity and costs..That’s why further developments and enhancements concerning TNC and Trusted Computing are required to finally succeed in having a real interoperable and unforgeable NAC solution, being easily adoptable an作者: 笨拙的我 時(shí)間: 2025-4-1 08:23
Antonio Candelieri,Bruno Galuzzi,Ilaria Giordani,Riccardo Perego,Francesco Archettiamples are also given in order to develop a better understanding. The author wants to resume, continue and develop the discussion about a topic which is or increasingly will be a critical factor of success for any security managers in larger organizations.作者: 倫理學(xué) 時(shí)間: 2025-4-1 13:56 作者: 反話 時(shí)間: 2025-4-1 15:39
Ilya Chernykh,Artem Pyatkinmber of IT and application vendors. Collectively, these forces form the basis of a nascent IdM market segment referred to as entitlement management..This new entitlement management market continues to evolve over time as the industry’s understanding of capabilities matures and enterprise requirement作者: Archipelago 時(shí)間: 2025-4-1 20:00 作者: 人類(lèi)學(xué)家 時(shí)間: 2025-4-1 22:49 作者: Urea508 時(shí)間: 2025-4-2 04:05
Panagiotis Karakostas,Angelo Sifaleras,Michael C. Georgiadisg research about an automated compliance analysis method specifically for the analysis of the business processes of a cloud service provider. Nowadays, customers of cloud services can only inquire the existence of single security features like a firewall. The review of the entire security concept on作者: Obituary 時(shí)間: 2025-4-2 10:39
