Results 201 to 210 of about 36,326 (261)

Miniature Soft Robot With Magnetically Reprogrammable Surgical Functions

Advanced Materials, EarlyView.
Miniature soft robots have great prospects to revolutionize minimally invasive treatments. Here we present a miniature soft robot, which can be reprogrammed to perform five surgical functionalities with six‐degrees‐of‐freedom motions. This soft robot can prospectively make minimally invasive surgery considerably safer and painless, and enable ...
Chelsea Shan Xian Ng, Yu Xuan Yeoh, Nicholas Yong Wei Foo, Keerthana Radhakrishnan, Guo Zhan Lum   +4 more
wiley   +1 more source

Research on railway emergency resource scheduling strategy under multiple uncertainty coupling. [PDF]

PLoS One
Sun J, Wan Y, Lu G, Tang Z.
europepmc   +1 more source

Multi-Strategy Enhanced White Shark Optimizer for Solving Job Shop Scheduling Problem. [PDF]

Biomimetics (Basel)
Cao L, Li M, Chen K, Yue Y, Qiu Y, Cheng Z.   +5 more
europepmc   +1 more source

Efficient Scheduling of Heterogeneous Messages in the FlexRay Dynamic Segment. [PDF]

Sensors (Basel)
Li M, Liu S, Sun H, Zhang K, Xu Y.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Parallel Scheduling Algorithms

Operations Research, 1983
Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms.
Eliezer Dekel, Sartaj Sahni
openaire   +1 more source

Iterative Scheduling Algorithms

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007
The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switch is the scheduling algorithm that decides which packets to transfer from ingress ports to egress ports in a given timeslot. It is desirable that such algorithms be iterative (so
Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Mayank Sharma   +3 more
openaire   +1 more source

On Manpower Scheduling Algorithms

SIAM Review, 1982
This paper provides a systematic review of several of the available manpower scheduling algorithms from a common framework. The five-stage framework is based on the recognition that the general scheduling problem can be decomposed into five separate but related subproblems or stages, namely, the determination of temporal manpower requirements, total ...
Tien, James M., Kamiyama, Angelica
openaire   +2 more sources

Parallelization of scheduling algorithms

Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96), 2002
Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. Parallelization of scheduling algorithms is a new research area. This paper discusses the essential issues of parallel static scheduling and presents an efficient parallel scheduling algorithm, the HPMCP algorithm.
Min-You Wu, Wei Shu
openaire   +1 more source

On synthesis of scheduling algorithms

Information Processing Letters, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. G. Gupta, V. S. P. Srivastava
openaire   +1 more source

A Heuristic Scheduling Algorithm

Journal of the Operational Research Society, 1980
This paper describes a heuristic algorithm developed to schedule a group of individuals such that every person performs each of the different activities they desire at some point during the time-frame of the schedule and the difference between the exogenously given number of people desired at each available location-activity-period position and those ...
Hosios, A. J., Rousseau, J. M.
openaire   +1 more source