Rüdiger Ebendt

According to our database1, Rüdiger Ebendt authored at least 23 papers between 2003 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Toward Fast and Accurate Map-to-Map Matching of City Street Maps.
Proceedings of the 23rd IEEE International Conference on Intelligent Transportation Systems, 2020

2016
Geometry-Based Matching of Routes Between Dissimilar Maps.
Proceedings of the Challenge of Transport Telematics, 2016

2014
Telematics for the Analysis of Vehicle Fleet Fuel Consumption.
Proceedings of the Telematics - Support for Transport, 2014

Automated Bias-Correction for Accurate FCD Processing Systems.
Proceedings of the Telematics - Support for Transport, 2014

2012
Evaluation of Microsimulated Traffic Light Optimisation Using V2I Technology.
Proceedings of the Telematics in the Transport Environment, 2012

2010
Optimizing Variable Ordering of BDDs with Double Hybridized Embryonic Genetic Algorithm.
Proceedings of the 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2010

2009
Weighted A<sup>*</sup> search - unifying view and application.
Artif. Intell., 2009

Approximate BDD Minimization by Weighted A.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2009), 2009

2007
Improvements for constraint solving in the systemc verification library.
Proceedings of the 17th ACM Great Lakes Symposium on VLSI 2007, 2007

2006
Effect of improved lower bounds in dynamic BDD reordering.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2006

A Framework for Quasi-exact Optimization Using Relaxed Best-First Search.
Proceedings of the KI 2006: Advances in Artificial Intelligence, 2006

On the sensitivity of BDDs with respect to path-related objective functions.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2006), 2006

2005
Combining ordered best-first search with branch and bound for exact BDD minimization.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2005

Exact BDD Minimization for Path-Related Objective Functions.
Proceedings of the VLSI-SoC: From Systems To Silicon, 2005

Quasi-Exact BDD Minimization Using Relaxed Best-First Search.
Proceedings of the 2005 IEEE Computer Society Annual Symposium on VLSI (ISVLSI 2005), 2005

Lower bounds for dynamic BDD reordering.
Proceedings of the 2005 Conference on Asia South Pacific Design Automation, 2005

Advanced BDD optimization.
Springer, ISBN: 978-0-387-25453-1, 2005

2004
Heuristic and exact optimization of reduced ordered binary decision diagrams (BDDs).
PhD thesis, 2004

A Tight Lower Bound for Dynamic BDD Reordering.
Proceedings of the Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), 2004

Minimization of the expected path length in BDDs based on local changes.
Proceedings of the 2004 Conference on Asia South Pacific Design Automation: Electronic Design and Solution Fair 2004, 2004

2003
An improved branch and bound algorithm for exact BDD minimization.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2003

Reducing the number of variable movements in exact BDD minimization.
Proceedings of the 2003 International Symposium on Circuits and Systems, 2003

Combination of Lower Bounds in Exact BDD Minimization.
Proceedings of the 2003 Design, 2003


  Loading...