Tobias Jacobs

According to our database1, Tobias Jacobs authored at least 27 papers between 2009 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
ITS and Real Time Cross Border Logistic Operations Optimization.
CoRR, 2021

2020
The Combinatorial Multi-Bandit Problem and its Application to Energy Management.
CoRR, 2020

Large-Scale Cargo Distribution.
CoRR, 2020

2019
A Study of the Learning Progress in Neural Architecture Search Techniques.
CoRR, 2019

On the Performance of Differential Evolution for Hyperparameter Tuning.
Proceedings of the International Joint Conference on Neural Networks, 2019

2017
Re-Designing Dynamic Content Delivery in the Light of a Virtualized Infrastructure.
IEEE J. Sel. Areas Commun., 2017

A holistic study of energy network hybridization in a Northern European City.
Proceedings of the 2017 IEEE PES Innovative Smart Grid Technologies Conference Europe, 2017

2016
Increasing the Utilization Ratio of Photovoltaic Energy by Network Hybridization.
Proceedings of the 2016 IEEE International Conferences on Big Data and Cloud Computing (BDCloud), 2016

2015
On the Performance of Smith's Rule in Single-Machine Scheduling with Nonlinear Cost.
ACM Trans. Algorithms, 2015

A Study of Caching Strategies for Web Service Discovery.
Proceedings of the 2015 IEEE International Conference on Web Services, 2015

2014
A New Perspective on the Windows Scheduling Problem.
CoRR, 2014

On the Huffman and Alphabetic Tree Problem with General Cost Functions.
Algorithmica, 2014

Improved Approximation Algorithms for the Average-Case Tree Searching Problem.
Algorithmica, 2014

Link discovery in social networks.
Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2014

2012
Analytical aspects of tie breaking.
Theor. Comput. Sci., 2012

The binary identification problem for weighted trees.
Theor. Comput. Sci., 2012

On Eulerian extensions and their application to no-wait flowshop scheduling.
J. Sched., 2012

On the Complexity of Optimal Hotlink Assignment.
Algorithmica, 2012

An Experimental and Analytical Study of Order Constraints for Single Machine Scheduling with Quadratic Cost.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011
On the complexity of searching in trees and partially ordered structures.
Theor. Comput. Sci., 2011

Constant factor approximations for the hotlink assignment problem.
ACM Trans. Algorithms, 2011

Binary Identification Problems for Weighted Trees.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

2010
An experimental study of recent hotlink assignment algorithms.
ACM J. Exp. Algorithmics, 2010

An Experimental Study of New and Known Online Packet Buffering Algorithms.
Algorithmica, 2010

On Greedy Algorithms for Decision Trees.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

On the Complexity of Searching in Trees: Average-Case Minimization.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Resistant Algorithms: Obtaining Simpler Proofs by Excluding Corner Cases
CoRR, 2009


  Loading...