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.
Filters
Set Cover with Delay – Clairvoyance is not Required
[article]
2020
arXiv
pre-print
Preserved Fulltext
Other Versions
In this paper, we show that this is not the case for set cover with delay (SCD) – specifically, we present the first non-clairvoyant algorithm, which is O(log n log m)-competitive, where n is the number ...
In most online problems with delay, clairvoyance (i.e. knowing the future delay of a request upon its arrival) is required for polylogarithmic competitiveness. ...
A simple, deterministic, non-clairvoyant algorithm for vertex cover with delay (VCD) which is 3competitive. ...
arXiv:1807.08543v3
fatcat:ooj6lsapyjdz3iiyibn7xzlxbi
Nearly-Tight Lower Bounds for Set Cover and Network Design with Deadlines/Delay
2021
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 2022; you can also visit the original URL.
The file type is application/pdf.
In this paper, we give nearly tight lower bounds for set cover with deadlines/delay. ...
The frameworks of FOCS 2020 also apply to set cover with deadlines/delay, in which requests arrive on the elements of a universe over time, and the algorithm must transmit sets to serve them. ...
The online set cover with deadlines/delay problem was first presented by Carrasco et al. ...
doi:10.4230/lipics.isaac.2021.53
fatcat:hoetyceakvfbtock4fpbxckepq
Page 7885 of Mathematical Reviews Vol. , Issue 99k
[page]
1999
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
, PA)
Speed is more powerful than clairvoyance. ...
Summary: “Given a set J = {t),f2,---,t,} of tasks, with each t; having unit execution time, a start-time s; > 0, a communica- tion delay t, and a set of precedence constraints which restrict allowable ...
Clairvoyant
2007
Proceedings of the 5th international conference on Embedded networked sensor systems - SenSys '07
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.
This paper describes Clairvoyant which is a comprehensive source-level debugger for wireless, embedded networks. ...
With Clairvoyant, a developer can wirelessly connect to a sensor network and execute standard debugging commands including break, step, watch, and backtrace, as well as new commands that are specially ...
Thus, this command does not set a breakpoint on all nodes in the network; it sets a breakpoint at one node but all nodes stop execution when the breakpoint is reached. ...
doi:10.1145/1322263.1322282
dblp:conf/sensys/YangSSW07
fatcat:quxmeeup6nci3gkw2qwuv6f63a
Improving Clairvoyant: reduction algorithm resilient to imbalanced process arrival patterns
2020
Journal of Supercomputing
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.
AbstractThe Clairvoyant algorithm proposed in "A novel MPI reduction algorithm resilient to imbalances in process arrival times" was analyzed, commented and improved. ...
The proposed improvements include skipping of idle loop rounds, simplifying generation of the ready set and management of the state array and an about 90-fold reduction in memory usage. ...
the beginning of the G group, as the Clairvoyant requires. ...
doi:10.1007/s11227-020-03499-1
fatcat:zzlltlsvjbbjrdj7kugnkittpi
Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints
[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.
In this paper, we design non-clairvoyant online algorithms for PSP and its special cases -- in this setting, the scheduler is unaware of the sizes of jobs. ...
More concretely, PSP models multidimensional resource requirements and parallelizability, as well as network bandwidth requirements found in data center scheduling. ...
Therefore, though fairness is a requirement, not all fair algorithms are competitive. Multidimensional scheduling is not the only application where the "right" notion of fairness is not clear. ...
arXiv:1404.1097v1
fatcat:kum3nsyvkzbpldwgri5iuqn5qu
Improving the Realism of Modeling Agronomic Adaptation to Climate Change: Simulating Technological Substitution
[chapter]
2003
Issues in the Impacts of Climate Variability and Change on Agriculture
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 compare corn yield outcomes using this new form of adaptation (logistic) with climatically optimized (clairvoyant) adaptation. ...
The results show logistic adaptation to be less effective than clairvoyant adaptation in ameliorating climate change impacts on yields, although the differences between the two sets of yields are statistically ...
data management, Cindy Hays for initial GIS programming, Larry McDaniel for providing climate data, and Mary Downton for her assistance with the statistical analysis. ...
doi:10.1007/978-94-017-1984-1_7
fatcat:4zobabdaurha5mob7p3cy4rpxq
Rhine's Telepathy and clairvoyance reconsidered; a summary, with a digest of comments by six English investigators
1946
Journal of the American Society for Psychical Research (1932)
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
“And the type of ESP ‘that is required here is pure clairvoyance; precogni- tive telepathy could not fill the need.”
Dr. ...
I also agree with Rhine that the apparent impossibility of clairvoyance is not a reason for deciding that it does not take place. ...
pmid:20998479
fatcat:axogv6sgfvbu5i543q3bvippvq
Prediction-based load control and balancing for feature extraction in visual sensor networks
2014
2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
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.
load in VSNs with good performance. ...
We formulate a prediction problem with random missing data, and propose two regression-based algorithms for data reconstruction. ...
and low delay. ...
doi:10.1109/icassp.2014.6853681
dblp:conf/icassp/ErikssonDF14
fatcat:zfgbgetmcvfxza34tor2znbrmq
Cloud Bursting
[chapter]
2011
Cloud 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.
On the one hand, enterprise applications are often faced with stringent requirements in terms of performance, delay, and service uptime. ...
In Figure 1.9(a) we compare the utilisation of the Queue Time based policy to its clairvoyant variant. This graph is essentially Figure 1.8(b) with the clairvoyant results superimposed. ...
doi:10.1201/b11149-19
fatcat:ks5eocwvzbc63ib6ratldgsamq
Truth and Regret in Online Scheduling
[article]
2017
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.
Furthermore, switching from one algorithm (a.k.a. expert) to another in an online fashion is challenging both because it requires synchronization with the state of the latter algorithm as well as because ...
We further show how to adapt our algorithm to a non-clairvoyant setting where job lengths are unknown until jobs are run to completion. ...
Due to this reason, the notion of promptness is not quite applicable to the non-clairvoyant setting. ...
arXiv:1703.00484v1
fatcat:btsht2ncibardb4si3fz4et6eu
Online Service with Delay
[article]
2017
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 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce the online service with delay problem. ...
Our main result is to show a poly-logarithmic competitive ratio for the online service with delay problem. This result is obtained by an algorithm that we call the preemptive service algorithm. ...
(This is what we use in our lower bound for the non-clairvoyant setting, where the algorithm does not know future delay penalties.) ...
arXiv:1708.05611v1
fatcat:qjvquzgwhnhirhnkqryuceia2u
Phase Tracking Sequences for 5G NR in 52.6-71 GHz Band: Design and Analysis
[chapter]
2021
Frontiers in Artificial Intelligence and Applications
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 2022; you can also visit the original URL.
The file type is application/pdf.
Performance of the different phase noise compensation algorithms is investigated for the baseline PTRS accepted in the current 5G NR specification and compared with the newly proposed approach to the PTRS ...
This approach is based on nulling the subcarriers adjacent to the reference signals to minimize influence of the ICI on the estimation process. ...
It can be called Clairvoyant algorithm for n-taps filter size. Degradation of this reference curve in comparison with ideal no noise case shows the amount of phase noise not covered by de-ICI filter. ...
doi:10.3233/faia210412
fatcat:zaaiectje5cypa2hoecrw2d4dq
Scheduling in the dark
1999
Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99
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 considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. ...
(This is why we say that the scheduler is completely in the dark.) ...
Acknowledgements I would like to thank Patrick Dymond, Faith Fich, and Xiaotie Deng for their continued support with scheduling. ...
doi:10.1145/301250.301299
dblp:conf/stoc/Edmonds99
fatcat:fz7nj635gbeazekfatnhqjn654
Scheduling in the dark
2000
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.
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. ...
(This is why we say that the scheduler is completely in the dark.) ...
Acknowledgements I would like to thank Patrick Dymond, Faith Fich, and Xiaotie Deng for their continued support with scheduling. ...
doi:10.1016/s0304-3975(99)00186-3
fatcat:cxs4tvykn5dzlcob7dnycqmobi
« Previous
Showing results 1 — 15 out of 1,294 results