Výsledky vyhľadávania - constraint-based construct heuristic algorithms

  1. 1

    Optimal constraint-based decision tree induction from itemset lattices Autor Nijssen, Siegfried, Fromont, Elisa

    ISSN: 1384-5810, 1573-756X
    Vydavateľské údaje: Boston Springer US 01.07.2010
    Vydané v Data mining and knowledge discovery (01.07.2010)
    “…: we use local patterns to construct a global model. We exploit the connection between constraints in pattern mining and constraints in decision tree induction to develop a framework for categorizing decision tree mining constraints…”
    Získať plný text
    Journal Article
  2. 2

    Fast capture of textured full-body avatar with RGB-D cameras Autor Lin, Shuai, Chen, Yin, Lai, Yu-Kun, Martin, Ralph R., Cheng, Zhi-Quan

    ISSN: 0178-2789, 1432-2315
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2016
    Vydané v The Visual computer (01.06.2016)
    “… The configuration of the multiple cameras is formulated as a constraint-based minimum set space-covering problem, which is approximately solved by a heuristic algorithm…”
    Získať plný text
    Journal Article
  3. 3

    3off2: A network reconstruction algorithm based on 2-point and 3-point information statistics Autor Affeldt, Séverine, Verny, Louis, Isambert, Hervé

    ISSN: 1471-2105, 1471-2105
    Vydavateľské údaje: London BioMed Central 20.01.2016
    Vydané v BMC bioinformatics (20.01.2016)
    “… By contrast, constraint-based methods, such as the PC and IC algorithms, are expected to run in polynomial time on sparse underlying graphs, provided…”
    Získať plný text
    Journal Article
  4. 4

    Reinforcement Learning-Based Dynamic Coverage Control of Multi-Rotor UAVs With Safety Priority Autor Ma, Zhuangzhuang, You, Junjie, Zhang, Yunlin, Cheng, Yuhua, Shao, Jinliang

    ISSN: 1545-5955, 1558-3783
    Vydavateľské údaje: IEEE 2025
    “…This paper considers the dynamic coverage control of multi-rotor Unmanned Aerial Vehicles (UAVs) with the limited sensory range, which aims to collect sensor…”
    Získať plný text
    Journal Article
  5. 5

    One-Shot Learning for MIPs with SOS1 Constraints Autor Robinson La Rocca, Charly, Cordeau, Jean-François, Frejinger, Emma

    ISSN: 2662-2556, 2662-2556
    Vydavateľské údaje: Cham Springer International Publishing 01.09.2024
    Vydané v Operations Research Forum (01.09.2024)
    “…Efficient algorithms and solvers are required to provide optimal or near-optimal solutions quickly and enable organizations to react promptly to dynamic situations such as supply chain disruptions…”
    Získať plný text
    Journal Article
  6. 6

    Knowledge Identification within the Decomposition of Homogeneous Classes of Objects Autor Terletskyi, Dmytro O., Yershov, Sergey V.

    ISSN: 2766-3639
    Vydavateľské údaje: IEEE 19.10.2023
    “… Therefore in this paper, we study the subclass identification within constraint-based filtering decomposition of homogeneous classes of objects, within the object object-oriented dynamic networks…”
    Získať plný text
    Konferenčný príspevok..
  7. 7

    GNSS-based End-of-Train Device Performance Evaluation and Improvement by Means of Particle Filter Algorithm Autor Duan, Guotao, Lu, Debiao, Dong, Haoqi, Cai, Baigen, Wang, Jian, Liu, Jiang

    Vydavateľské údaje: IEEE 05.09.2022
    “…The Train Integrity Monitoring System (TIMS) function is becoming more and more demanding for the next generation for train control (NGTC) in both China and…”
    Získať plný text
    Konferenčný príspevok..
  8. 8

    Data-driven control for dynamic quantized nonlinear systems with state constraints based on barrier functions Autor Wang, Xueli, Zhao, Shangwei, Wang, Xin, Yang, Ming, Wu, Xiaoming

    ISSN: 0020-0255
    Vydavateľské údaje: Elsevier Inc 01.10.2023
    Vydané v Information sciences (01.10.2023)
    “… By employing three sets of neural networks (NNs), a data-based goal representation heuristic dynamic programming algorithm with the concurrent learning technique is offered to achieve the near-optimal control objective without model requirement…”
    Získať plný text
    Journal Article
  9. 9

    One-shot Learning for MIPs with SOS1 Constraints Autor Charly Robinson La Rocca, Cordeau, Jean-François, Frejinger, Emma

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 14.03.2024
    Vydané v arXiv.org (14.03.2024)
    “…Efficient algorithms and solvers are required to provide optimal or near-optimal solutions quickly and enable organizations to react promptly to dynamic situations such as supply chain disruptions…”
    Získať plný text
    Paper
  10. 10

    Exact and heuristic procedures for capacity expansion problems with congestion Autor Kim, Sukgon, Uzsoy, Reha

    ISSN: 0740-817X, 2472-5854, 1545-8830, 2472-5862
    Vydavateľské údaje: Norcross Taylor & Francis Group 01.12.2008
    Vydané v IIE transactions (01.12.2008)
    “… Previous to this work non-linear constraints based on expected queue length have been used to represent congestion, whereas concave clearing functions that capture the relationship between expected…”
    Získať plný text
    Journal Article
  11. 11

    A new method for floor planning using topological constraint reduction Autor Vijayan, G., Tsay, R.-S.

    ISSN: 0278-0070
    Vydavateľské údaje: New York, NY IEEE 01.12.1991
    “…An approach to the constraint-based floor planning of flexible, fixed, and preplaced blocks that is based on the removal of redundant constraints and the reshaping of flexible blocks is discussed…”
    Získať plný text
    Journal Article
  12. 12

    Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints Autor Noyan, Nilay, Ruszczyński, Andrzej

    ISSN: 0025-5610, 1436-4646
    Vydavateľské údaje: Berlin/Heidelberg Springer-Verlag 01.08.2008
    Vydané v Mathematical programming (01.08.2008)
    “…Stochastic dominance relations are well studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing…”
    Získať plný text
    Journal Article
  13. 13

    An efficient selector for multi-granularity attribute reduction Autor Liu, Keyu, Yang, Xibei, Fujita, Hamido, Liu, Dun, Yang, Xin, Qian, Yuhua

    ISSN: 0020-0255, 1872-6291
    Vydavateľské údaje: Elsevier Inc 01.12.2019
    Vydané v Information sciences (01.12.2019)
    “…•Multi-granularity is considered in the attribute reduction for improving classification performances.•Multi-granularity attribute selector is proposed to…”
    Získať plný text
    Journal Article
  14. 14

    Hybrid method integrating agent-based modeling and heuristic tree search for scheduling of complex batch processes Autor Chu, Yunfei, You, Fengqi, Wassick, John M.

    ISSN: 0098-1354, 1873-4375
    Vydavateľské údaje: Kidlington Elsevier Ltd 10.01.2014
    Vydané v Computers & chemical engineering (10.01.2014)
    “… To overcome myopic decisions of agents, the agent-based simulation is embedded into a heuristic search algorithm…”
    Získať plný text
    Journal Article
  15. 15

    Dynamic constraint and objective generation approach for real-time train rescheduling model under human-computer interaction Autor Kai Liu, Jianrui Miao, Zhengwen Liao, Xiaojie Luan, Lingyun Meng

    ISSN: 2949-8678
    Vydavateľské údaje: KeAi Communications Co., Ltd 01.12.2023
    Vydané v High-Speed Railway (01.12.2023)
    “… By summarizing rescheduling rules, we devise a rule-based conflict detection-resolution heuristic algorithm to effectively…”
    Získať plný text
    Journal Article
  16. 16

    面向局部多约束的属性约简方法研究 Autor 董杰, 王逊, 张文冬, 王平心, 杨习贝

    ISSN: 1673-9418
    Vydavateľské údaje: 江苏科技大学 计算机学院,江苏 镇江,212003%江苏科技大学 理学院,江苏 镇江,212003 01.05.2019
    Vydané v 计算机科学与探索 (01.05.2019)
    “…TP18; 传统求解约简的启发式算法采用单一的度量指标作为约束条件,但这一策略并不能保证约简满足多重度量指标下约束需求.除此之外,绝大多数的约简定义是建立在考虑所有决策…”
    Získať plný text
    Journal Article
  17. 17

    Selection Method for Cloud Manufacturing Industrial Services Based on Generative AdversarialNetworks Autor ZHENG Xiubao, LI Jing, ZHU Ming, NING Yingying

    ISSN: 1002-137X
    Vydavateľské údaje: Editorial office of Computer Science 01.04.2025
    Vydané v Ji suan ji ke xue (01.04.2025)
    “…,it isn’t easy to select the best industrial resource services.Most of the existing selection optimization methods are based on heuristic algorithms,but these algorithms cannot often adapt to the cloud manufacturing…”
    Získať plný text
    Journal Article
  18. 18

    Exact and Heuristic Approaches to Batching-And-Scheduling for the Composites Manufacturing Problem Autor Tang, Tanya Y

    ISBN: 9798698547273
    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2020
    “… By extending state-of-the-art techniques from a wide literature body, we construct solution approaches using techniques from Mixed Integer…”
    Získať plný text
    Dissertation
  19. 19

    Response Time Driven Scheduling for Programmable Logic Controllers with Network-Based I/O Systems Autor Jeong, Seungkweon, Chang, Naehyuck, Kwon, Wook Hyun

    ISSN: 0922-6443, 1573-1383
    Vydavateľské údaje: New York Springer Nature B.V 01.07.2003
    Vydané v Real-time systems (01.07.2003)
    “… A heuristic algorithm is developed to satisfy the two objectives, timing constraints and low resource occupation at the same time…”
    Získať plný text
    Journal Article
  20. 20

    Identifying Key Nodes and Edges of High-speed Rail Network Based on Minimum Weighted Connected Dominating Set Autor Li, Wenxia, Liu, Linzhong, Li, Zhuo

    ISSN: 1992-9978, 1992-9986
    Vydavateľské údaje: Hong Kong International Association of Engineers 01.07.2025
    “… A heuristic algorithm with immune mechanism and greedy repair strategy is designed based on the constraints of node dominance and connectivity, with the goal of minimizing the network weight ratio…”
    Získať plný text
    Journal Article