Results 11 to 20 of about 2,774 (93)

OASIcs, Volume 85, ATMOS 2020, Complete Volume

, 2020
OASIcs, Volume 85, ATMOS 2020, Complete ...
D. Huisman, C. Zaroliagis
semanticscholar   +4 more sources

OASIcs, Volume 89, iPMVM 2020, Complete Volume

, 2021
OASIcs, Volume 89, iPMVM 2020, Complete ...
Christoph Garth, J. Aurich, B. Linke, Ralf Müller, B. Ravani, Gunther H. Weber, B. Kirsch   +6 more
semanticscholar   +4 more sources

OASIcs, Volume 5, ATMOS'06, Complete Volume

, 2012
OASIcs, Volume 5, ATMOS'06, Complete ...
Jacob, Riko, Müller-Hannemann, Matthias
openaire   +3 more sources

Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical Analysis

, 2017
Answer Set Programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on the ground+solve approach.
Cuteri, Bernardo, Dodaro, Carmine, Ricca, Francesco, Schüller, Peter   +3 more
core   +2 more sources

Algorithm Engineering in Robust Optimization

, 2015
Robust optimization is a young and emerging field of research having received a considerable increase of interest over the last decade. In this paper, we argue that the the algorithm engineering methodology fits very well to the field of robust ...
A Agra, A Atamtürk, A Beck, A Ben-Tal, A Ben-Tal, A Ben-Tal, A Ben-Tal, A Ben-Tal, A Ben-Tal, A Ben-Tal, A Ben-Tal, A Ben-Tal, A Ben-Tal, A Erera, A Kasperski, A Kasperski, A Kasperski, A Kasperski, A Mutapcic, A Ouorou, A Sbihi, A Schöbel, A Soyster, A Takeda, AB Chassein, B Roy, C Bohle, C Büsing, C Büsing, C Liebchen, D Bertsimas, D Bertsimas, D Bertsimas, D Bertsimas, D Bertsimas, D Bertsimas, D Bertsimas, D Bertsimas, D Catanzaro, D Delling, D Golovin, DJ Alem, DJ Thuente, E Conde, E Conde, E Conde, E Conde, F Bruns, F Pérez-Galarce, F Taniguchi, G Calafiore, G Calafiore, GC Calafiore, H Aissi, H Aissi, H Iida, H Mausser, H Yaman, HE Mausser, I Averbakh, I Averbakh, J Goh, J Lin, J Löfberg, J Pereira, J Xu, JE Falk, JLG Velarde, JM Mulvey, JR Farias de, KS Goetzmann, L Jenkins, LE Ghaoui, M Bürger, M Fischetti, M Fischetti, M Fischetti, M Goerigk, M Goerigk, M Goerigk, M Goerigk, M Goerigk, M Goerigk, M Goerigk, M Goerigk, M Goerigk, M Inuiguchi, M López, M Monaci, M Monaci, MC Campi, MK Zanjani, N Eggenberg, O Berman, P Adasme, P Kouvelis, P Sanders, P Zieliński, PC Bouman, R Kalai, R Khandekar, R Montemanni, R Montemanni, R Montemanni, R Reemtsen, S Cicerone, S Siddiqui, S Suzuki, TS Ng, U Feige, V Cacchiani, V Jeyakumar, X Song, Y Nikulin, Y Yin   +114 more
core   +1 more source

Establishing large mammal population trends from heterogeneous count data

Ecology and Evolution, Volume 14, Issue 8, August 2024.
Valuable data of wildlife population counts in game reserves has been accumulating over time. Counts are yet often of various natures and collected in a haphazard way. As a consortium of managers and methodologists, we have devised reasonable rules for rendering counts comparable and provide a flexible analytical tool for estimating population ...
R. Pradel, P.‐C. Renaud, O. Pays, P. Scholte, J. O. Ogutu, F. Hibert, N. Casajus, F. Mialhe, H. Fritz   +8 more
wiley   +1 more source

Superlinear advantage for exact quantum algorithms [PDF]

, 2013
A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms.
Ambainis, Andris
core   +1 more source

Route Planning in Transportation Networks [PDF]

, 2015
We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale.
Bast, Hannah, Delling, Daniel, Goldberg, Andrew, Müller-Hannemann, Matthias, Pajor, Thomas, Sanders, Peter, Wagner, Dorothea, Werneck, Renato F.   +7 more
core  

Efficient Traffic Assignment for Public Transit Networks [PDF]

, 2017
We study the problem of computing traffic assignments for public transit networks: Given a public transit network and a demand (i.e. a list of passengers, each with associated origin, destination, and departure time), the objective is to compute the ...
Briem, Lars, Buck, H. Sebastian, Ebhart, Holger, Mallig, Nicolai, Strasser, Ben, Vortisch, Peter, Wagner, Dorothea, Zündorf, Tobias   +7 more
core   +1 more source

Continuous Non-Intrusive Hybrid WCET Estimation Using Waypoint Graphs [PDF]

, 2016
Traditionally, the Worst-Case Execution Time (WCET) of Embedded Software has been estimated using analytical approaches. This is effective, if good models of the processor/System-on-Chip (SoC) architecture exist.
Dreyer, Boris, Hochberger, Christian, Lange, Alexander, Wegener, Simon, Weiss, Alexander   +4 more
core   +1 more source