Yaodong Cui

Orcid: 0000-0003-1132-9154

According to our database1, Yaodong Cui authored at least 48 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Medium-Fidelity Evaluation and Modeling for Perception Systems of Intelligent and Connected Vehicles.
IEEE Trans. Intell. Veh., January, 2024

Integrating Large Language Models and Metaverse in Autonomous Racing: An Education-Oriented Perspective.
IEEE Trans. Intell. Veh., January, 2024

DriveLLM: Charting the Path Toward Full Autonomous Driving With Large Language Models.
IEEE Trans. Intell. Veh., January, 2024

2023
A Spontaneous Driver Emotion Facial Expression (DEFE) Dataset for Intelligent Vehicles: Emotions Triggered by Video-Audio Clips in Driving Scenarios.
IEEE Trans. Affect. Comput., 2023

Robust Learning for Autonomous Driving Perception Tasks in Cyber-Physical-Social Systems.
Proceedings of the IEEE 3rd International Conference on Digital Twins and Parallel Intelligence, 2023

2022
TransNet: Full Attention Network for CSI Feedback in FDD Massive MIMO System.
IEEE Wirel. Commun. Lett., 2022

Deep Learning for Image and Point Cloud Fusion in Autonomous Driving: A Review.
IEEE Trans. Intell. Transp. Syst., 2022

2020
A Spontaneous Driver Emotion Facial Expression (DEFE) Dataset for Intelligent Vehicles.
CoRR, 2020

Deep Learning for Image and Point Cloud Fusion in Autonomous Driving: A Review.
CoRR, 2020

2019
A heuristic for the skiving and cutting stock problem in paper and plastic film industries.
Int. Trans. Oper. Res., 2019

2017
New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers.
J. Oper. Res. Soc., 2017

Triple-solution approach for the strip packing problem with two-staged patterns.
J. Comb. Optim., 2017

A constructive heuristic for the two-dimensional bin packing based on value correction.
Int. J. Comput. Appl. Technol., 2017

The Optimization Algorithm of Circle Stock Problem with Standard Usage Leftover.
Proceedings of the Intelligence Science I, 2017

2016
Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns.
Optim. Methods Softw., 2016

Hybrid approach for the two-dimensional bin packing problem with two-staged patterns.
Int. Trans. Oper. Res., 2016

2015
Heuristic for constrained two-dimensional three-staged patterns.
J. Oper. Res. Soc., 2015

Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost.
Eur. J. Oper. Res., 2015

Sequential heuristic for the two-dimensional bin-packing problem.
Eur. J. Oper. Res., 2015

2014
Heuristic for the two-dimensional arbitrary stock-size cutting stock problem.
Comput. Ind. Eng., 2014

2013
A new dynamic programming procedure for three-staged cutting patterns.
J. Glob. Optim., 2013

Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns.
Eur. J. Oper. Res., 2013

Heuristic for the rectangular strip packing problem with rotation of items.
Comput. Oper. Res., 2013

2012
Reducing the number of cuts in generating three-staged cutting patterns.
Eur. J. Oper. Res., 2012

Heuristic for constrained T-shape cutting patterns of rectangular pieces.
Comput. Oper. Res., 2012

A CAM system for one-dimensional stock cutting.
Adv. Eng. Softw., 2012

2011
C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction.
Optim. Methods Softw., 2011

A recursive branch-and-bound algorithm for constrained homogenous T-shape cutting patterns.
Math. Comput. Model., 2011

2010
A bi-objective guillotine cutting problem of stamping strips of equal circles.
Int. J. Comput. Math., 2010

A heuristic for the one-dimensional cutting stock problem with usable leftover.
Eur. J. Oper. Res., 2010

Strips minimization in two-dimensional cutting stock of circular items.
Comput. Oper. Res., 2010

A simple algorithm for generating optimal equal circle cutting patterns with minimum sections.
Adv. Eng. Softw., 2010

2009
Heuristic algorithm for a cutting stock problem in the steel bridge construction.
Comput. Oper. Res., 2009

2008
An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem.
Optim. Methods Softw., 2008

T-shape homogenous block patterns for the two-dimensional cutting problem.
J. Glob. Optim., 2008

Simplest optimal guillotine cutting patterns for strips of identical circles.
J. Comb. Optim., 2008

A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem.
Comput. Oper. Res., 2008

Heuristic and exact algorithms for generating homogenous constrained three-staged cutting patterns.
Comput. Oper. Res., 2008

2007
Simple block patterns for the two-dimensional cutting problem.
Math. Comput. Model., 2007

Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors.
J. Comb. Optim., 2007

Two-stage general block patterns for the two-dimensional cutting problem.
Comput. Oper. Res., 2007

An exact algorithm for generating homogenous T-shape cutting patterns.
Comput. Oper. Res., 2007

2006
Simplest optimal cutting patterns for equal rectangles.
Oper. Res. Lett., 2006

Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors.
Eur. J. Oper. Res., 2006

Generating optimal two-section cutting patterns for rectangular blanks.
Comput. Oper. Res., 2006

Dynamic Programming Algorithms for Generating Optimal Strip Layouts.
Comput. Optim. Appl., 2006

2005
A cutting stock problem and its solution in the manufacturing industry of large electric generators.
Comput. Oper. Res., 2005

Generating optimal T-shape cutting patterns for circular blanks.
Comput. Oper. Res., 2005


  Loading...