Results 31 to 40 of about 110,413 (286)
Algorithms for the minimum sum coloring problem: a review [PDF]
, 2016 The Minimum Sum Coloring Problem (MSCP) is a variant of the well-known vertex coloring problem which has a number of AI related applications. Due to its theoretical and practical relevance, MSCP attracts increasing attention.
Hamiez, Jean-Philippe +2 more
core +3 more sources
A stabilized adaptive appearance changes model for 3D head tracking [PDF]
, 2001 A simple method is presented for 3D head pose estimation and tracking in monocular image sequences. A generic geometric model is used. The initialization consists of aligning the perspective projection of the geometric model with the subjects head in the
Heijden, Ferdinand van der +1 more
core +3 more sources
Revisiting the Self-adaptive Large Neighborhood Search
, 2018 This paper revisits the Self-Adaptive Large Neighborhood Search introduced by Laborie and Godard. We propose a variation in the weight-update mechanism especially useful when the LNS operators available in the portfolio exhibit unequal running times. We also propose some generic relaxations working for a large family of problems in a black-box fashion.
Thomas, Charles +2 more
openaire +2 more sources
Adaptive Large Neighborhood Search for Circle Bin Packing Problem
, 2020 We address a new variant of packing problem called the circle bin packing problem (CBPP), which is to find a dense packing of circle items to multiple square bins so as to minimize the number of used bins. To this end, we propose an adaptive large neighborhood search (ALNS) algorithm, which uses our Greedy Algorithm with Corner Occupying Action (GACOA)
He, Kun +4 more
openaire +2 more sources
A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem
Algorithms, 2019 The transportation of elderly and impaired people is commonly solved as a Dial-A-Ride Problem (DARP). The DARP aims to design pick-up and delivery vehicle routing schedules.
Slim Belhaiza
doaj +1 more source
A Heuristic Approach for a Real-World Electric Vehicle Routing Problem
Algorithms, 2019 To develop a non-polluting and sustainable city, urban administrators encourage logistics companies to use electric vehicles instead of conventional (i.e., fuel-based) vehicles for transportation services.
Mengting Zhao, Yuwei Lu
doaj +1 more source
IEEE Access, 2023 The unrelated parallel machine scheduling problem with sequence dependent setup times (UPMSP-SDST) addressed in this study refers to allocating jobs among a given number of machines and determining their processing sequence on each machine, to minimize ...
Bin Ji +3 more
doaj +1 more source
A study on exponential-size neighborhoods for the bin packing problem with conflicts
, 2017 We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various ...
Capua, Renatha +3 more
core +1 more source
Unsupervised Feature Selection with Adaptive Structure Learning [PDF]
, 2015 The problem of feature selection has raised considerable interests in the past decade. Traditional unsupervised methods select the features which can faithfully preserve the intrinsic structures of data, where the intrinsic structures are estimated using
Alelyani S. +12 more
core +1 more source
IEEE Access, 2021 The Partial Max-SAT (PMSAT) problem is an optimization variant of the well-known Propositional Boolean Satisfiability (SAT) problem. It holds an important place in theory and practice, because a huge number of real-world problems, such as timetabling ...
Haifa Hamad Alkasem +1 more
doaj +1 more source