A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
No speed dating please! Patterns of social preference in male and female house mice
2017
Frontiers in Zoology
Preserved Fulltext
In this study, we monitored the partner preference behaviour of female and male wild house mice (Mus musculus domesticus) from populations in Germany (G) and France (F) in a controlled cage setup for 5 ...
In our study, preference seems to be potentially associated with paternal MHC distance. ...
Availability of data and materials The data which supports the findings of this study are available from the corresponding author upon reasonable request. ...
doi:10.1186/s12983-017-0224-y
pmid:28747988
pmcid:PMC5525247
fatcat:g3k3ivegjngr5jb6se5pktve6e
Throughput maximization in multiprocessor speed-scaling
2016
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
a pseudopolynomial-time algorithm for the weighted throughput version, and (b) the case of agreeable instances, i.e. for which r i ≤ r j if and only if d i ≤ d j , for which we present a pseudopolynomial-time ...
More specifically, we consider: (a) the case of identical processing volumes, i.e. p i,j = p for every i and j, for which we present a polynomial-time algorithm for the unweighted version, which becomes ...
Given an energy budget E, the objective function is max{w ...
doi:10.1016/j.tcs.2016.03.020
fatcat:g4qdndxa2bh6bppqka5pwq2jla
Throughput Maximization in Multiprocessor Speed-Scaling
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
a pseudopolynomial-time algorithm for the weighted throughput version, and (b) the case of agreeable instances, i.e. for which r i ≤ r j if and only if d i ≤ d j , for which we present a pseudopolynomial-time ...
More specifically, we consider: (a) the case of identical processing volumes, i.e. p i,j = p for every i and j, for which we present a polynomial-time algorithm for the unweighted version, which becomes ...
Given an energy budget E, the objective function is max{w ...
doi:10.1007/978-3-319-13075-0_20
fatcat:pqe7kme76fgllokj7i5vcf2r2u
Energy-Efficient Scheduling with Time and Processors Eligibility Restrictions
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The energy-efficient scheduling problem, involving task assignment and speed scaling, is inherently complicated as it is proved to be NP-Complete. ...
We formulate the problem as an Integer Programming (IP) problem. Specifically, we devise a polynomial time optimal scheduling algorithm for the case tasks have an uniform size. ...
They proposed an optimal algorithm in the case where the jobs have release dates, deadlines and the power parameter α > 2. ...
doi:10.1007/978-3-642-40047-6_10
fatcat:vul6pl2u4veoriembzqgddmzp4
Throughput Maximization in Multiprocessor Speed-Scaling
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
a pseudopolynomial-time algorithm for the weighted throughput version, and (b) the case of agreeable instances, i.e. for which r_i < r_j if and only if d_i < d_j, for which we present a pseudopolynomial-time ...
More specifically, we consider: (a) the case of identical processing volumes, i.e. p_i,j=p for every i and j, for which we present a polynomial-time algorithm for the unweighted version, which becomes ...
for evaluating the performance of scheduling algorithms for problems involving jobs that are subject to release dates and deadlines [14, 24, 13] . ...
arXiv:1402.3782v1
fatcat:cdev4on5jfbkrmyl5ogqitje2y
Multicast Due Date Round-Robin Scheduling Algorithm for Input-Queued Switches
2016
International Journal of Computer Network and Information Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The objective of this paper is to design a scheduling algorithm called MDDR (Multicast Due Date Round-Robin) scheduling to achieve maximum throughput and low delay that has two phases request and grant ...
This paper discusses the challenges of scheduling algorithms for multicast in high-speed switches that reduces the overhead of adaptation by selecting a HOL (Head of Line Cell) using Round Robin pointer ...
CONCLUSION This study proposes a flexible, simple, and fair multicast scheduling algorithm which reduces the complexity of scheduling greatly with very little lose of switching performance, and offers ...
doi:10.5815/ijcnis.2016.02.07
fatcat:cete5biesjah3dbh7awupgfb7y
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This is true even for a special case that is equivalent to the covering version of the well-studied and prominent unsplittable flow on a path problem, which is interesting in its own right. ...
For that covering problem, we present a quasi-polynomial time (1 + ε)-approximation algorithm that yields an (e + ε)-approximation for the above scheduling problem. ...
reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. ...
doi:10.1007/978-3-662-43948-7_52
fatcat:m5k7nypj7va5lalthr7vn646ea
Energy-Efficient Scheduling with Time and Processors Eligibility Restrictions
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
The energy-efficient scheduling problem, involving task assignment and speed scaling, is inherently complicated as it is proved to be NP-Complete. ...
We formulate the problem as an Integer Programming (IP) problem. Specifically, we devise a polynomial time optimal scheduling algorithm for the case tasks have a uniform size. ...
They proposed an optimal algorithm in the case where the jobs have release dates, deadlines and the power parameter α > 2. ...
arXiv:1301.4131v3
fatcat:yfzqtigmhzgrvawx547d32xm3e
Getting the best response for your erg
2008
ACM Transactions on Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We propose an algorithmic approach in which an energy optimal schedule is computed for a huge A, and then the energy optimal schedule is maintained as A decreases. ...
Speeding scaling, which involves dynamically changing the power over time, is a power management technique available in current microprocessors from AMD, Intel and Transmeta. ...
The observation that that our algorithm for equi-work jobs can be applied to arbitrary work jobs arose from discussions with Sandy Irani and John Augustine. ...
doi:10.1145/1367064.1367078
fatcat:k6taal2z6fhg5fxd5pr7qw25je
Optimizing Vehicle-to-Cloud Data Transfers using Soft Real-Time Scheduling Concepts
2020
Proceedings of the 28th International Conference on Real-Time Networks and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Third, we estimate the bounds of an optimal clairvoyant algorithm in order to have a baseline for a fair comparison of existing scheduling algorithms. ...
Second, we provide an extension of a classical algorithm for the generation of workloads, by increasing its coverage with regards to our use-case representation. ...
An on-line scheduling algorithm is said to be speed-s optimal if the algorithm can match the performance of an optimal clairvoyant algorithm with the same number of processors but having s times higher ...
doi:10.1145/3394810.3394818
dblp:conf/rtns/IbarzLRFF20
fatcat:tkr4lp6kfvdsnmm5cynfi5wk2a
Getting the Best Response for Your Erg
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We propose an algorithmic approach in which an energy optimal schedule is computed for a huge A, and then the energy optimal schedule is maintained as A decreases. ...
Speeding scaling, which involves dynamically changing the power over time, is a power management technique available in current microprocessors from AMD, Intel and Transmeta. ...
The observation that that our algorithm for equi-work jobs can be applied to arbitrary work jobs arose from discussions with Sandy Irani and John Augustine. ...
doi:10.1007/978-3-540-27810-8_3
fatcat:aof7hmzhkjhfbahk3ia3q7y37u
Resource-aware allocation strategies for divisible loads on large-scale systems
2009
2009 IEEE International Symposium on Parallel & Distributed Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show how to reduce this problem to a classical preemptive scheduling problem on a single machine, thereby establishing new complexity results, and providing new approximation algorithms and heuristics ...
In this paper, we deal with the large-scale divisible load problem studied in [12] . ...
Acknowledgment We thank the reviewers for their comments and suggestions. This work was supported in part by the ANR StochaGrid project. ...
doi:10.1109/ipdps.2009.5160912
dblp:conf/ipps/BenoitMPRV09
fatcat:tmm73eq3rzejtlqqnvn6hjrv7a
Scheduling with processing set restrictions: A survey
2008
International Journal of Production Economics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Scheduling problems with processing set restrictions have been studied extensively by computer scientists and operations researchers under different names. ...
Our survey covers offline and online problems, as well as nonpreemptive and preemptive scheduling environments. ...
Spyropoulos and Evans (1985b) give a faster algorithm for P |M j (inclusive)| C j . Their algorithm does not involve solving a matching problem, and its running time is just O(n 2 ). ...
doi:10.1016/j.ijpe.2008.09.003
fatcat:2e7mynkf7bfn7jv4uxbqmbkbti
The interaction between scheduling and control of semi-cyclic hybrid systems
2018
IFAC-PapersOnLine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In a case study the railway traffic on a single track is considered, showing that updating the schedule results in feasible local speed profiles for the trains and less delay in the overall system in case ...
In an iterative procedure the optimal and feasible schedule can be computed. ...
In a case study the railway traffic on a single track is considered, showing that updating the schedule results in feasible local speed profiles for the trains and less delay in the overall system in case ...
doi:10.1016/j.ifacol.2018.06.303
fatcat:ytpgmgyx3bdhnisd57qu7opfky
Applications of computational intelligence for design and operations decisions in manufacturing
2011
International Journal of Production Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A case study illustrates the use of the proposed method and compares it to other methods. ...
A case study for the scheme evaluation and screening of rotor and bearing systems for a turbine generator is presented to demonstrate the application of the hybrid decision method. ...
doi:10.1080/00207543.2011.571439
fatcat:d2z4gci25jh5blhtaehcvjfxxm
« Previous
Showing results 1 — 15 out of 32,127 results