Filters








39 Hits in 8.7 sec

Enhancing the performance of safety applications in IEEE 802.11p/WAVE Vehicular Networks

Marco Di Felice, Ali J. Ghandour, Hassan Artail, Luciano Bononi
2012 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)  
To cope with this problem, we propose a WAVE-enhanced Safety message Delivery scheme (WSD) that minimizes the delivery delay of safety messages in multi-channel VANETs, while preserving compatibility with  ...  We formulate the broadcast problem in multi-channel VANETs as a scheduling problem over the different DSRC channels.  ...  ACKNOWLEDGMENT Marco Di Felice is supported by Italian MIUR funds under the project PRIN-2009 STEM-Net: "STEM" devices for self organizing wireless NETworks.  ... 
doi:10.1109/wowmom.2012.6263694 dblp:conf/wowmom/FeliceGAB12 fatcat:unpa7hdx6bch3a4szvc7eshl7i

Recent advances in evolutionary and bio-inspired adaptive robotics: Exploiting embodied dynamics

Phil Husbands, Yoonsik Shim, Michael Garvie, Alex Dewar, Norbert Domcsek, Paul Graham, James Knight, Thomas Nowotny, Andrew Philippides
2021 Applied intelligence (Boston)  
It is shown how a multi-objective evolutionary algorithm can be used to evolved dynamical neural controllers for a simulated flapping wing robot with feathered wings.  ...  The first exploits the dynamical properties of a physical electronic substrate, demonstrating for the first time how component-level analog electronic circuits can be evolved directly in hardware to act  ...  The whole procedure was processed for two weeks on a parallel computing platform using 160 virtual CPUs.  ... 
doi:10.1007/s10489-021-02275-9 fatcat:zzmwbtjcqzffnmvifr4fmixr6u

Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles [article]

Constantin Dalyac, Loïc Henriet, Emmanuel Jeandel, Wolfgang Lechner, Simon Perdrix, Marc Porcheron, Margarita Veshchezerova
2020 arXiv   pre-print
We present a case study of such a protocol for two industrial problems drawn from the strongly developing field of smart-charging of electric vehicles.  ...  Tailored implementations of the Quantum Approximate Optimization Algorithm (QAOA) have been developed for both problems, and tested numerically with classical resources either by emulation of Pasqal's  ...  It was granted access to the HPC resources of CINES under the allocation 2019-A0070911024 made by GENCI.  ... 
arXiv:2012.14859v1 fatcat:s6mqcfhy2jg73d4mnzt3b6kl2a

Enclosing rail capacity/punctuality in accessibility measures: a two-step approach by using Data Envelopment Analysis and Analytic Hierarchy Process

Francesco Rotoli, Elena Navajas Cawood, Lorenzo Vannacci
2015 2015 International Conference on Industrial Engineering and Systems Management (IESM)  
We conclude with a number of challenging research directions.  ...  Multi and intermodal freight transportation refers to moving loads by a sequence of transportation modes linked by mode-tomode transfers performed at intermodal terminals, generally without directly handling  ...  Abstract-We address in this paper the problem of scheduling a set of independent and non-preemptive jobs on two identical parallel machines with a single operator in order to minimize the makespan.  ... 
doi:10.1109/iesm.2015.7380133 fatcat:hbiqir2zo5bejlasdudkjzom2e

Elements of Scheduling [article]

Jan Karel Lenstra, David B. Shmoys
2020 arXiv   pre-print
They set out to compile a survey with Ron Graham (1979), but progress on the book was hampered by the many research opportunities offered by the field.  ...  We continue to receive requests from colleagues who look for a text on the elements of scheduling at an advanced undergraduate or early graduate level.  ...  Rather than assume the existence of a single machine that can perform a given operation, we could assume that a given operation can be performed on any one of a set of identical, uniform or unrelated parallel  ... 
arXiv:2001.06005v1 fatcat:5w7dwzh6nrbb7ateihvrac3734

Bi-Criteria Multiple Knapsack Problem with Grouped Items [article]

Francisco Castillo-Zunino, Pinar Keskinocak
2020 arXiv   pre-print
The multiple knapsack problem with grouped items aims to maximize rewards by assigning groups of items among multiple knapsacks, considering knapsack capacities.  ...  Either all items in a group are assigned or none at all. We propose algorithms which guarantee that rewards are not less than the optimal solution, with a bound on exceeded knapsack capacities.  ...  This item assignment sub-problem is equivalent to a parallel machine scheduling problem where each item corresponds to a job (durations are their weights), and each knapsack i ∈ M corresponds to an identical  ... 
arXiv:2006.00322v1 fatcat:jsv44yznefdizjkll3vozsbhw4

Distributed Computing With the Cloud [article]

Yehuda Afek and Gal Giladi and Boaz Patt-Shamir
2021 arXiv   pre-print
We use these primitives to derive algorithms for combining, where every processor node has an input value and the task is to compute a combined value under some given associative operator.  ...  in a ring, and are all connected to a single cloud node.  ...  In [8] , a cryptographic protocol for FL is presented, under the assumption that any two users can communicate directly.  ... 
arXiv:2109.12930v1 fatcat:ruu65p7xgfaztodqcd4xp2c4qe

Ran Architecture Components – Final Report

EU H2020 5G NORMA
2017 Zenodo  
Standardization relevance and potential of 5G NORMA innovations are discussed and a comparison with respective aspects of the 3GPP next generation architecture is made.  ...  The main goal of 5G NORMA is to propose a multi-tenant multi-service mobile network architecture that adapts the use of the mobile network resources to the service requirements, the variations of the traffic  ...  The two different modes are depicted in Figure 6 -2. The UE is connected with two links, one to AP1 and the other to AP2.  ... 
doi:10.5281/zenodo.1119054 fatcat:mh7k74dd25coti2kwk7vnakgti

Ran Architecture Components – Final Report

EU H2020 5G NORMA
2017 Zenodo  
Standardization relevance and potential of 5G NORMA innovations are discussed and a comparison with respective aspects of the 3GPP next generation architecture is made.  ...  The main goal of 5G NORMA is to propose a multi-tenant multi-service mobile network architecture that adapts the use of the mobile network resources to the service requirements, the variations of the traffic  ...  The two different modes are depicted in Figure 6 -2. The UE is connected with two links, one to AP1 and the other to AP2.  ... 
doi:10.5281/zenodo.1119053 fatcat:gkv54v4gzvhedowtm3tic4d65u

Consistent Labeling of Rotating Maps [chapter]

Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
2011 Lecture Notes in Computer Science  
We are interested in a consistent labeling of P under rotation, i.e., an assignment of a single (possibly empty) active interval of angles for each label that determines its visibility under rotations  ...  We study the following dynamic map labeling problem: The input is an abstract map consisting of a set P of points in the plane with attached horizontally aligned rectangular labels.  ...  A.G. and M.N. were supported by the Concept for the Future of KIT within the framework of the German Excellence Initiative (grant YIG 10-209).  ... 
doi:10.1007/978-3-642-22300-6_38 fatcat:f2o6vxa27rh2nhu7jyjcpflv44

A tutorial on mechanism design in scheduling

Ruben Hoeksma
2018 The Second International Workshop on Dynamic Scheduling Problems   unpublished
Problems of this kind appear in many applications. The most common examples are scheduling problems with time-, position-and resourcedependent job processing times.  ...  The IWDSP 2018 workshop is the second event in the series started in 2016, focused on dynamic scheduling problems defined by parameters whose values are varying in time.  ...  I thank Stanisław Gawiejnowicz for help in improving the English of the paper.  ... 
doi:10.14708/isbn.978-83-951298-0-3p31-36 fatcat:upbdgmjlpfcbfojmhb5z7dt6mq

The first international workshop on dynamic scheduling problems

Stanisław Gawiejnowicz
2016 The first international workshop on dynamic scheduling problems   unpublished
Acknowledgments Supported by the RSF grant No 15-11-10009. June 30 -July 1, 2016, Poznań, Poland  ...  For the special case with identical parallel machines, P j denotes the random variable for job j's processing time.  ...  A schedule for the speed scaling problem with single mode two-processor jobs of energy consumption OPT + ε can be found in time polynomial in 1 ε and size of the instance.  ... 
doi:10.14708/isbn.978-83-937220-7-5prg fatcat:w3w7ntcf55ezbdfnawpyg4i57a

Evolution of Transistor Circuits

Martin Albrecht Trefzer
2006
A modular framework for the evolution of circuits on configurable substrates has been developed, which is used to perform the experiments and is further demonstrated to be useful for modeling FPTA architectures  ...  problems from the designer and there are to date only rudimentary analytical solutions for parameterizing circuit topologies.  ...  There are two operation modes of the random wires mutation, namely the create mode and the erase mode.  ... 
doi:10.11588/heidok.00007035 fatcat:e4m6g7tey5ftfkvbivpehvgdri

Labelled superposition [article]

Arnaud Fietzke, Universität Des Saarlandes, Universität Des Saarlandes
2014
The work presented in this thesis consists of two parts: The first part presents a formalization of the splitting rule for case analysis in superposition and a proof of its correctness, as well as the  ...  with unbounded integer variables; and thirdly, a formalism for modelling probabilistic timed systems with first-order background theories, as well as a novel approach for the analysis of such systems based  ...  Working in the Automation of Logic group has been an inspiring and enriching experience, and I want to thank my current and former colleagues for providing a great research environment.  ... 
doi:10.22028/d291-26569 fatcat:r7234yakofbgngu3oyjvj5ghjm

Theory and Engineering of Scheduling Parallel Jobs

Jochen Matthias Speck
2018
The main result is a provably fast and efficient scheduling algorithm for malleable jobs. Experiments show the importance and possibilities of scheduling considering the memory hierarchy.  ...  Scheduling is very important for an efficient utilization of modern parallel computing systems.  ...  Example: We have a parallel machine with 4 identical cores, two identical malleable jobs each with work amount 6 (the sequential running time), weight ω j = 1 and the speedup function: # cores 1 2 3 4  ... 
doi:10.5445/ir/1000084153 fatcat:w3epxjmm6bhunmqzrlqmnyoleu
« Previous Showing results 1 — 15 out of 39 results