Name
Affiliation
Papers
JÖRG LÄSSIG
Dept. of Comput. Sci., Univ. of Appl. Sci., Zittau/Gorlitz, Görlitz, Germany
48
Collaborators
Citations 
PageRank 
69
175
22.53
Referers 
Referees 
References 
295
745
397
Search Limit
100745
Title
Citations
PageRank
Year
A Benchmark Model for the Creation of Compute Instance Performance Footprints.00.342018
Microservices for Redevelopment of Enterprise Information Systems and Business Processes Optimization.00.342018
Towards an Architecture for Pseudonymous E-Commerce - Applying Privacy by Design to Online Shopping.00.342018
A generic problem instance generator for discrete optimization problems.00.342018
Highly Scalable Microservice-based Enterprise Architecture for Smart Ecosystems in Hybrid Cloud Environments.00.342017
An Application Meta-Model To Support The Execution And Benchmarking Of Scientific Applications In Multi-Cloud Environments00.342017
Practical Web Data Extraction: Are We There Yet? - A Short Survey10.352016
Tackling Common Due Window Problem with a Two-Layered Approach.00.342016
The Flip-Flop SLA Negotiation Strategy Using Concession Extrapolation and 3D Utility Function00.342016
Evolutionary Multi-Objective Ensembles For Wind Power Prediction00.342016
Scalability and performance of the Privacy-Aware Classification method GenPAC.00.342016
Global versus local search: the impact of population sizes on evolutionary algorithm performance.60.422016
Towards Efficient Resource Management in Cloud Computing: A Survey30.372016
Semantic Processing for the Conversion of Unstructured Documents into Structured Information in the Enterprise Context.00.342016
Un-restricted Common Due-Date Problem with Controllable Processing Times - Linear Algorithm for a Given Job Sequence.00.342015
Regional Carbon Footprinting for Municipalities and Cities.00.342014
DenGraph-HO: a density-based hierarchical graph clustering algorithm20.402014
Energieinformatik - Aktuelle und zukünftige Forschungsschwerpunkte.00.342014
Common due-window problem: Polynomial algorithms for a given processing sequence00.342014
A Novel Approach to the Common Due-Date Problem on Single and Parallel Machines.00.342014
Energy Informatics - Current and Future Research Directions.130.832014
Common Due-Date Problem: Linear Algorithm for a Given Job Sequence00.342014
Verification Requirements for Secure and Reliable Cloud Computing.10.392013
Enterprise application integration - the cloud perspective00.342013
Dynamic Integration of ALM Tools for Agile Software Development.10.432013
Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence30.432013
Design and analysis of migration in parallel evolutionary algorithms170.632013
Aircraft Landing Problem: An Efficient Algorithm for a Given Landing Sequence60.472013
General Upper Bounds on the Running Time of Parallel Evolutionary Algorithms00.342012
Hierarchically structured energy markets as novel smart grid control approach20.362011
Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization - (Extended Abstract).00.342011
Adaptive population models for offspring populations and parallel evolutionary algorithms321.042011
Analysis of speedups in parallel evolutionary algorithms for combinatorial optimization80.542011
Analysis And Efficiency Of Randomized Optimization Heuristics00.342010
General scheme for analyzing running times of parallel evolutionary algorithms281.332010
Power prediction in smart grids with evolutionary local kernel regression121.682010
New Approaches To Enterprise Cooperation Generation And Management10.402010
Experimental supplements to the theoretical analysis of migration in the Island model100.602010
The benefit of migration in parallel evolutionary algorithms181.182010
Managing Energy in a Virtual Power Plant Using Learning Classifier Systems10.362010
Adaptive Heuristic Estimates for Automated Planning Using Regression10.352010
On The Structure Of A Best Possible Crossover Selection Strategy In Genetic Algorithms10.372009
Intelligent Support System for Enterprise Cooperation Management10.402009
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms20.382008
Merging Groups for the Exploration of Complex State Spaces in the CPSO Approach00.342008
Cross Company Resource and Time Assignment in a Combinatorial Auction Scenario00.342007
Generation of SME Production and Logistics Networks with Extremal Optimization and Fitness Threshold Accepting00.342007
An Agent-based Manufacturing Management System for Production and Logistics within Cross-Company Regional and National Production Networks50.712005