853 citations
- Sorbonne UniversitéFR398 papers
- Centre National de la Recherche ScientifiqueFR380 papers
- Université Paris CitéFR136 papers
- Université Pierre-et-Marie-CurieFR97 papers
- University of EdinburghGB89 papers
- Institut national de recherche en sciences et technologies du numériqueFR85 papers
- Université Paris-SaclayFR67 papers
- University of OxfordGB54 papers
- École PolytechniqueFR50 papers
- Sorbonne Paris CitéFR48 papers
- Massachusetts Institute of TechnologyUS45 papers
- Universidade Federal do Rio de JaneiroBR45 papers
Showing 2015 · cs.DSShow all
3 papers · 2 filters
cs.DS2015
Calibrations Scheduling Problem with Arbitrary Lengths and Activation Length
Eric Angel, Evripidis Bampis, Vincent Chau +1
Bender et al. (SPAA 2013) have proposed a theoretical framework for testing in contexts where safety mistakes must be avoided. Testing in such a context is made by machines that ne…
cs.DS2015★ 11 cited
Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems
Spyros Angelopoulos, Giorgio Lucarelli, Nguyen Kim Thang
We study online scheduling problems on a single processor that can be viewed as extensions of the well-studied problem of minimizing total weighted flow time. In particular, we pro…
cs.DS2015★ 3 cited
Computing maximal cliques in link streams
Tiphaine Viard, Matthieu Latapy, Clémence Magnien
A link stream is a collection of triplets indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in graphs to…