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.
Filters
Grouping Techniques for Scheduling Problems: Simpler and Faster
2007
Algorithmica
Preserved Fulltext
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. ...
We illustrate the technique on two different scheduling problems: scheduling on unrelated parallel machines with costs and the job shop scheduling problem. ...
However, the proposed combination reduces the number of jobs immediately to a constant and leads to elegant and simpler approximation schemes for the two considered scheduling problems. ...
doi:10.1007/s00453-007-9086-6
fatcat:h7eqalppgfaf5bu3uuxxs3rfdi
Grouping Techniques for Scheduling Problems: Simpler and Faster
[chapter]
2001
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.
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. ...
We illustrate the technique on two different scheduling problems: scheduling on unrelated parallel machines with costs and the job shop scheduling problem. ...
However, the proposed combination reduces the number of jobs immediately to a constant and leads to elegant and simpler approximation schemes for the two considered scheduling problems. ...
doi:10.1007/3-540-44676-1_17
fatcat:gkwvvgyc55de7jlr7aaxe3smqy
Simpler and faster HLBVH with work queues
2011
Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics - HPG '11
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.
In this work we present a simpler and faster variant of HLBVH, where all the complex bookkeeping of prefix sums, compaction and partial breadth-first tree traversal needed for spatial partitioning has ...
The new algorithm is both faster and more memory efficient, removing the need for temporary storage of geometry data for intermediate computations. ...
Aknowledgements We thank the University of Utah for the Fairy scene, Anat Grynberg and Greg Ward for the Conference scene and the University of North Carolina for the PowerPlant model. ...
doi:10.1145/2018323.2018333
dblp:conf/egh/GaranzhaPM11
fatcat:ncahk723tndzdmtcrmcynei7cu
MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues
[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.
Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or branch-and-bound. ...
Acknowledgements We would like to thank the SAP HANA group for bringing the three authors together, and Jean-François Méhaut for providing a testing platform. ...
For p = 56, MultiQueues are about 1.9 times faster than SprayLists for c = 2 and about 2.5 times faster for c = 4. ...
arXiv:1411.1209v1
fatcat:gmwxoaft5zas3jdex5hjq2ncky
A Simpler and Faster NIC Driver Model for Network Functions
2020
USENIX Symposium on Operating Systems Design and Implementation
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.
Current network stacks trade simplicity for performance and flexibility, especially in their driver model. ...
The advent of software network functions calls for stronger correctness guarantees and higher performance at every level of the stack. ...
Acknowledgements We thank our shepherd Simon Peter for his useful feedback and guidance; the anonymous reviewers for their useful and detailed reviews; the anonymous artifact evaluators for their useful ...
dblp:conf/osdi/PirelliC20
fatcat:cfwdcmi6bbfnnghf6gd7eddsy4
An effective greedy heuristic for the Social Golfer Problem
2011
Annals of Operations 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.
We use this heuristic in a complete backtracking search, and match the best current results of constraint solvers for several SGP instances with a much simpler method. ...
In particular, our method is the first metaheuristic technique that can solve the original problem instance optimally. ...
The problem is readily generalized to the following decision problem: Is it possible to schedule n = g×p golfers in g groups of p players for w weeks such that no two golfers play in the same group more ...
doi:10.1007/s10479-011-0866-7
fatcat:bqbjunvlqrdmha4vcwmungto3m
Modeling and Optimization Problems in Contact Centers
2006
Third International Conference on the Quantitative Evaluation of Systems - (QEST'06)
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 2011; you can also visit the original URL.
The file type is application/pdf.
the performance measures of interest, and developing algorithms and software to optimize the staffing and scheduling of agents. ...
This is discussed in the context of a multiskill center, in which different types of calls are handled by different agent groups (with different skill sets). ...
The authors thanks Christos Alexopoulos, Eric Buist, Vijay Mehrotra, Ornella Pisacane, and Auke Pot for their helpful suggestions. ...
doi:10.1109/qest.2006.34
dblp:conf/qest/LEcuyer06
fatcat:lhhdii5xozanbmgn7hnapsoxty
RTS AI Problems and Techniques
[chapter]
2015
Encyclopedia of Computer Graphics and Games
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.
Artificial Intelligence problems related to RTS games deal with the behavior of an artificial player. ...
Definition Real-Time Strategy (RTS) games is a sub-genre of strategy games where players need to build an economy (gathering resources and building a base) and military power (training units and researching ...
For example Ponsen and Spronck [42] used evolutionary learning techniques, but face the same problem of dimensionality. ...
doi:10.1007/978-3-319-08234-9_17-1
fatcat:6w2ysoduwfa5pa4qs4cjzpa3si
Nurse rostering problems––a bibliographic survey
2003
European Journal of Operational 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 2020; you can also visit the original URL.
The file type is application/pdf.
The good scheduling of nurses has impact on the quality of health care, the recruitment of nurses, the development of budgets and other nursing functions. ...
Hospitals need to repeatedly produce duty rosters for its nursing staff. ...
Because of tedious and time-consuming manual scheduling, and for various other reasons, the nurse rostering problem (NRP) or the nurse scheduling problem (NSP) has attracted much research attention. ...
doi:10.1016/s0377-2217(03)00021-3
fatcat:42rrnhcujvgczdg7tc2yxmgj6a
Meta-Heuristic Solutions to a Student Grouping Optimization Problem faced in Higher Education Institutions
[article]
2020
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.
The majority of NP-hard problems faced in institutions involve grouping students and/or resources, albeit with each problem having its own unique set of constraints. ...
To this end, this study described an optimization problem faced in a real university that involved grouping students for the presentation of semester results. ...
The constraints for the Student Grouping Problem in this study is simpler than the constraints for the Educational Timetabling Problem. ...
arXiv:2010.00499v1
fatcat:cd6yfe7yw5ezhda75utvedfcse
Solving scheduling problems from high-level models
2010
4OR
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 are very varied, both in application domains and in featured constraints. They have been a large area of research for decades. ...
A lot of work has been undertaken to express, classify, and solve scheduling problems. ...
Faster Computation of RS(A) A faster and more elegant way to compute the RS(A) exists for a special case that appears often in practice. ...
doi:10.1007/s10288-010-0143-7
fatcat:xl2o2skrdzcjroge7ymc4rnxlm
A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
1997
European Journal of Operational 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 2004; you can also visit the original URL.
The file type is application/pdf.
scheduling problem, and tabu search. ...
Results show that the compressed solution space performs well with small problems, and is superior to standard tabu search solution spaces for large-scale, realistically sized problems. ...
Acknowledgments The authors would like to thank the three anonymous referees for their helpful comments on this paper. ...
doi:10.1016/s0377-2217(96)00239-1
fatcat:bikywg65s5b5jjnjhud7q6y3my
Incomplete Dynamic Backtracking for Linear Pseudo-Boolean Problems
2004
Annals of Operations 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.
This paper describes such an algorithm for pseudo-Boolean models. ...
Many combinatorial problems can be modeled as 0/1 integer linear programs. ...
"Weak-Commitment Search for Solving Constraint Satisfaction Problems." In Twelfth National Conference on Artificial Intelligence, pp. 313-318. AAAI Press. ...
doi:10.1023/b:anor.0000032570.90510.8f
fatcat:uwfj7o47yjfl7p6t6mmba2qlw4
THE ECZEMA PROBLEM
1930
American Journal of the Medical Sciences
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
is at fault. (2) The group of predisposing causes already discussed as active in the simpler eczemas—the ichthyotic
STOKES: THE ECZEMA PROBLEM 81
and the seborrheic makeup, the focal infections, the gastrointestinal ...
Bloch is undoubtedly right in asserting that the tangibilities are on the side of the externalists and that they are advancing much faster for the moment in their share of the working out of the etiologic ...
doi:10.1097/00000441-193001000-00008
fatcat:6afxiq4jwvetxavq3ppx6xb2ky
Solving path problems on the GPU
2010
Parallel Computing
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 2016; you can also visit the original URL.
The file type is application/pdf.
Using the all-pairs shortest-paths problem as an example, we uncover potential gains over this class of algorithms. ...
The alternate schedule of path computations allowed us to cast almost all operations into matrix-matrix multiplications on a semiring. ...
Thanks to Fenglin Liao and Arda Atali for their help during the initial implementation on Cuda. ...
doi:10.1016/j.parco.2009.12.002
fatcat:gpdffk6s4fa4tifrawtmq5x22a
« Previous
Showing results 1 — 15 out of 30,612 results