Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Chia-Man Hung"'
Autor:
Chia-man Hung, 洪嘉蔓
98
This study, in which acquired employees were experimental group and acquiring employees were control group, explore the impact of changing environment, personality traits and personal factors on organizational commitment after the merger. Thr
This study, in which acquired employees were experimental group and acquiring employees were control group, explore the impact of changing environment, personality traits and personal factors on organizational commitment after the merger. Thr
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/61010896590038063317
Autor:
Chia-Man Hung, Shaohong Zhong, Walter Goodwin, Oiwi Parker Jones, Martin Engelcke, Ioannis Havoutis, Ingmar Posner
We present a novel approach to path planning for robotic manipulators, in which paths are produced via iterative optimisation in the latent space of a generative model of robot poses. Constraints are incorporated through the use of constraint satisfa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b40aa60f3df3e71029cf8aa4f201b047
http://arxiv.org/abs/2210.11779
http://arxiv.org/abs/2210.11779
Publikováno v:
ICRA
Visuomotor control (VMC) is an effective means of achieving basic manipulation tasks such as pushing or pick-and-place from raw images. Conditioning VMC on desired goal states is a promising way of achieving versatile skill primitives. However, commo
Publikováno v:
ICRA
End-to-end visuomotor control is emerging as a compelling solution for robot manipulation tasks. However, imitation learning-based visuomotor control approaches tend to suffer from a common limitation, lacking the ability to recover from an out-of-di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9cdf8ea3f4ab94fd3ec1fa65cdf6cab0
Publikováno v:
Discrete Mathematics. 338:2348-2355
A strong edge-coloring of a graph is a function that assigns to each edge a color such that two edges within distance two apart receive different colors. The strong chromatic index of a graph is the minimum number of colors used in a strong edge-colo