Filters








2,508 Hits in 4.5 sec

Decongesting Traffic at Coordinated Junctions in a Multi-Road Intersection using Graph Coloring based Technique

A. Sanusi B., T. Adeyemo Z., O. Omidiora E., O. Olabiyisi S., O. Olowoye A., O. Oyediran M.
2020 Zenodo  
The detailed model was reproduced on a MATLAB situation for four cycles with each cycle at Cross-type convergence viable.  ...  The graph coloring technique was planned by including a boundary (mLan) to the underlying sign timing plan (iLan) to give the following theory signal timing plan.  ...  Graph Coloring Algorithms There are numerous heuristic consecutive procedures for coloring a graph. One of them is the Greedy Graph Coloring which was received in this paper.  ... 
doi:10.5281/zenodo.3991662 fatcat:27hct6g3rbdlxdq3naf242r7uu

Page 4553 of Mathematical Reviews Vol. , Issue 96h [page]

1996 Mathematical Reviews  
Additional results concerning G,(M) and a few methods for constructing weakly factor perfect matrices are then given. 96h:05077 05C15 05C38 05C85 Preater, J. (4-KEEL; Keele) A passage time for greedy-coloring  ...  Summary: “We consider the progress of the greedy vertex coloring algorithm applied to cycle graphs.  ... 

Cyclic Sparse Greedy Deconvolution

Khalid SABRI
2012 International Journal of Image Graphics and Signal Processing  
The purpose of this study is to introduce the concept of cyclic sparsity or cyclosparsity in deconvolution framework for signals that are jointly sparse and cyclostationary.  ...  Given the Impulse Response (IR), the aim is to retrieve the original object which has been distored by passage through a known linear and time-invariant system in presence of noise.  ...  Thus, ̃ is a matrix with particular structure i.e. the nonzero columns for each cycle are deduced by shifting the columns of the first cycle with a multiple of the cyclic period .  ... 
doi:10.5815/ijigsp.2012.12.01 fatcat:t43bq3dqozckbj4iqcqvl6lv44

Adversarial queueing theory

Allan Borodin, Jon Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson
1996 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96  
Acknowledgements We thank Nabil Kahale, Tom Leighton, and Ken Sevcik for valuable discussions on queueing theory and routing.  ...  We also show that any greedy discipline is stable on the directed cycle for a smaller injection rate of single paths. (5) Let P be an arbitrary greedy queueing discipline, and G the directed cycle.  ...  Probabilistic analyses in which a Poisson or Bernoulli process generates packets bound for random destinations; the passage time through an edge is a constant as in packet routing (see [9] , for example  ... 
doi:10.1145/237814.237984 dblp:conf/stoc/BorodinKRSW96 fatcat:gtgkjsa3pjgjpcjl2wynfx5wtq

Inference of multiple trajectories in single cell RNA-seq data from RNA velocity [article]

Ziqi Zhang, Xiuwei Zhang
2020 bioRxiv   pre-print
These methods are often restricted to certain trajectory structures like trees or cycles, and the directions of the trajectory can only be partly inferred when the root cell is provided.  ...  We present CellPaths, a single cell trajectory inference method that infers developmental trajectories by integrating RNA velocity information.  ...  We use mean first passage time 50 as the pseudotime for the random walk based method.  ... 
doi:10.1101/2020.09.30.321125 fatcat:k7jpnbfrcvbehjb3olyuiywxha

Mind the gap: a heuristic study of subway tours

M. Drozdowski, D. Kowalski, J. Mizgajski, D. Mokwa, G. Pawlak
2014 Journal of Heuristics  
Time evolution of the trade-off is also captured. Then, the algorithms are tested on a range of instances with diverse features.  ...  What is the minimum tour visiting all lines in a subway network? In this paper we study the problem of constructing the shortest tour visiting all lines of a city railway system.  ...  Acknowledgments This research has been partially supported by a Grant of Polish National Science Center.  ... 
doi:10.1007/s10732-014-9252-3 fatcat:riitqgg5ybdh3c3ald4ddktgiu

A study of first-passage time minimization via Q-learning in heated gridworlds [article]

M.A. Larchenko, P. Osinenko, G. Yaremenko, V.V. Palyulin
2021 arXiv   pre-print
Optimization of first-passage times is required in applications ranging from nanobots navigation to market trading.  ...  We extensively study how a learning agent fares in 1- and 2- dimensional heated gridworlds with an uneven temperature distribution.  ...  ACKNOWLEDGMENT The authors acknowledge the use of computational resources of the Skoltech CDISE supercomputer Zhores for obtaining the results presented in this paper as well as the support of the Russian  ... 
arXiv:2110.02129v1 fatcat:meruxtnhs5cifhurjyqqrzemm4

Atlas of Skin Diseases Atlas of the Diseases of the Skin . By Balmanno Squire, M. B. London: J. & A. Churchill. 1878

1878 Boston Medical and Surgical Journal  
This the author accounts for by a peculiar " electric energy," which " operates to decompose the infectious molecule of exotic diseases and prevent their development," and which is derived from the influence  ...  In view of their nomadic habits and the large numbers of Americans and English whom business, pleasure, or a search for health cause to travel or sojourn in foreign countries, for a longer or shorter time  ...  A good deal of excitement was created in England last year by the threatened passage in France of a law withdrawing from the Minister of Public Instruction the power which he has possessed for many years  ... 
doi:10.1056/nejm187808080990606 fatcat:rzeneewhwvchrdup7bziidsimm

A study of first-passage time minimization via Q-learning in heated gridworlds

Maria A. Larchenko, Pavel Osinenko, Grigory Yaremenko, Vladimir V. Palyulin
2021 IEEE Access  
Optimization of first-passage times is required in applications ranging from nanobots navigation to market trading.  ...  Namely, the statedependency of noise triggers convergence to suboptimal solutions and the respective policies follow them for practically long learning times.  ...  ACKNOWLEDGMENT The authors acknowledge the use of computational resources of the Skoltech CDISE supercomputer Zhores for obtaining the results presented in this paper as well as the support of the Russian  ... 
doi:10.1109/access.2021.3129709 fatcat:bdcgydw4qve7fm7fhxotrkim7q

Floating Car Data Adaptive Traffic Signals: A Description of the First Real-Time Experiment with "Connected" Vehicles

Astarita, Giofré, Festa, Guido, Vitale
2020 Electronics  
For the first time in the history of traffic management, a traffic signal has been regulated in real time with real "connected" vehicles.  ...  Despite the feasibility of using Floating Car Data (FCD), for signal control, there have been practically no real experiments with all "connected" vehicles to regulate traffic signals in real-time.  ...  Acknowledgments: The authors wish to thanks Gianfranco Salfi and Claudio Capalbo for managing drone video footage, all the students that participated in the experiment, the rector of the University of  ... 
doi:10.3390/electronics9010114 fatcat:m7xs6ceg2bbavn5ea3ajrsflnm

Firefighting Equipment Arrangement Optimization for an Offshore Platform Considering Travel Distances

Byeong Cheol Lee, Youngsu Choi, Hyun Chung
2021 Journal of Marine Science and Engineering  
However, except for the traditional greedy approximation, this problem is not well researched for general solutions.  ...  Then, we proposed a method to obtain an approximate optimization solution using a modified greedy method including rearrangement.  ...  Nash designed the Theta* algorithm, a method for real-time smoothing by determining the visibility in real time in the process of expanding the scope of exploration [15] .  ... 
doi:10.3390/jmse9050503 fatcat:ajcm2zgfdjcnlg2dh5umugykvu

Path diversity is only part of the problem

R.A. Knepper, M.T. Mason
2009 2009 IEEE International Conference on Robotics and Automation  
field evaluates its path set for collision a single time before following the chosen path in entirety.  ...  A path-set-based planner navigates by repeatedly testing each of these robot-fixed paths for collision with obstacles. A heuristic function selects which of the surviving paths to follow next.  ...  A greedy planner naturally attempts to graze every obstacle (and follow narrow passages) where doing so minimizes the heuristic solution cost.  ... 
doi:10.1109/robot.2009.5152696 dblp:conf/icra/KnepperM09 fatcat:5ldpvo4h55gnbp7ye2kchru56a

Teaching Humans When to Defer to a Classifier via Exemplars

Hussein Mozannar, Arvind Satyanarayan, David Sontag
2022 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Using this model, we derive a near-optimal strategy for selecting a representative teaching set.  ...  For this collaboration to perform properly, the human decision maker must have a mental model of when and when not to rely on the agent.  ...  In the appendix we show similar results for setting A and B with the DOUBLE-GREEDY strategy.  ... 
doi:10.1609/aaai.v36i5.20469 fatcat:cj2wcq56k5apfnaesqfiirhmim

Tuning continual exploration in reinforcement learning: An optimality property of the Boltzmann strategy

Youssef Achbany, François Fouss, Luh Yen, Alain Pirotte, Marco Saerens
2008 Neurocomputing  
Convergence of those equations to a local minimum is proved for a stationary environment.  ...  The theoretical results are confirmed by simple simulations showing that the proposed exploration strategy outperforms the -greedy strategy.  ...  shortest paths and the iterative algorithm for computing the average first-passage time.  ... 
doi:10.1016/j.neucom.2007.11.040 fatcat:jzun5ds2ovayfkpjwfqesnv2tm

An Enhanced Method for Scheduling Observations of Large Sky Error Regions for Finding Optical Counterparts to Transients

Javed Rana, Akshat Singhal, Bhooshan Gadre, Varun Bhalerao, Sukanta Bose
2017 Astrophysical Journal  
We incorporate realistic observing constraints like the diurnal cycle, telescope pointing limitations, available observing time, and the rising/setting of the target at the observatory location.  ...  sky in a single night.  ...  For simplicity, we say that tiles with setting time t k in this range "belong to" the window W j . Greedy Array (GrAr) First we discuss the intuitive greedy algorithm.  ... 
doi:10.3847/1538-4357/838/2/108 fatcat:sinrmsptvbbpbkctexbnn62ndy
« Previous Showing results 1 — 15 out of 2,508 results