Results 101 to 110 of about 9,676,374 (323)
Calculation of queue formation and queue length at airport check-in counters
Acta Polytechnica CTU ProceedingsThis paper focuses on calculation of airport passenger queue formation and its length. The main goal of the paper is to evaluate the appropriateness of the combination of machine learning and determistic algorithm for queue length determination.
Petr Had, Jiří Volt, Slobodan Stojić
doaj +1 more source
Exact and Heuristic Algorithms for Runway Scheduling [PDF]
, 2016 This paper explores the Single Runway Scheduling (SRS) problem with arrivals, departures, and crossing aircraft on the airport surface. Constraints for wake vortex separations, departure area navigation separations and departure time window restrictions ...
Jung, Yoon C., Malik, Waqar A.
core +1 more source
No App, No Entry: Conceptualizing Digital Technology Captivity in Service Access
Psychology &Marketing, EarlyView.ABSTRACT We introduce Digital Technology Captivity (DTC), a form of consumer vulnerability that arises when digital technologies become the mandatory gateway to essential services. When access is tied to systems that feel unfamiliar, complex, or intimidating—and when preferred alternatives are limited—consumers may experience heightened vulnerability ...
Carolyn Wilson‐Nash +4 more
wiley +1 more source
Desain Aplikasi Antrian Berbasis Android [PDF]
, 2016 Waiting is a boring thing for most people. Moreover, if a person waiting in a very long queue. It provides a deterrent effect because they do not know how much longer they must to wait to get a service.Therefore, they invented a queueing system Android ...
Budi, Y. S. (Yosafat) +2 more
core
TopoMAS: Large Language Model Driven Topological Materials Multi‐Agent System
Materials Genome Engineering Advances, EarlyView.TopoMAS is an interactive multi‐agent framework that revolutionizes topological materials discovery through human–AI collaborative intelligence. The system integrates natural language processing, knowledge retrieval from literature and databases, crystal structure generation, and automated first‐principles calculations within a unified workflow.
Baohua Zhang +5 more
wiley +1 more source
Steps in Designing Queue and Interview Process Using Information System: a Case of Re-registration of New Students in Universitas Negeri Makassar [PDF]
, 2016 . Universitas Negeri Makassar (UNM) have a number of prospective students is quite a lot. Based on data released by the BAPSI UNM (2015) that the data student candidates of UNM who passed the selection with SNMPTN SBMPTN selection as 3,791 people. If the
Ahmar, A. S. (Ansari) +2 more
core
An Exact Method for Reliable Shortest Path Problems With Correlation
Networks, EarlyView.ABSTRACT Shortest path problems often arise in contexts where travel times are uncertain. In these settings, reliable paths are often valued more than paths with lower expected travel times. This has led to several variants of reliable shortest path problems (RSPP) that handle travel time reliability differently. We propose an algorithmic framework for
Esteban Leiva +3 more
wiley +1 more source
Defective and Clustered Graph Colouring
, 2018 Consider the following two ways to colour the vertices of a graph where the requirement that adjacent vertices get distinct colours is relaxed. A colouring has "defect" $d$ if each monochromatic component has maximum degree at most $d$.
Wood, David R.
core
Desas Desus Informasi Haji dalam Hubungannya dengan Daftar Tunggu Bagi Calon Jemaah Haji di Kabupaten Gowa [PDF]
, 2015 Rumors information Hajj often bring news is not true, circulated from mouth to mouth very quickly and circulated like a snowball throws prospective pilgrims. This research aims to: Knowing the form of rumors circulating among Hajj information prospective
Farid, M. (Muhammad) +2 more
core
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
Networks, EarlyView.ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz +2 more
wiley +1 more source