Weise Thomas - Citegraph

Author Info

Name	Affiliation	Papers
WEISE THOMAS	Univ Sci & Technol China, Sch Comp Sci & Technol, USTC Birmingham Joint Res Inst Intelligent Comput, Hefei 230027, Anhui, Peoples R China	80
Collaborators	Citations	PageRank
127	682	44.68
Referers	Referees	References
1476	1846	1235

Search Limit

1001000

Publications (80 rows)

Collaborators (100 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Chemical Safety Sign Detection: A Survey and Benchmark	0	0.34	2022
Distance regularization energy terms in level set image segment model: A survey	0	0.34	2022
A novel approach to subgraph selection with multiple weights on arcs	0	0.34	2022
Frequency Fitness Assignment: Making Optimization Algorithms Invariant Under Bijective Transformations of the Objective Function Value	0	0.34	2021
Solving job shop scheduling problems without using a bias for good solutions	0	0.34	2021
Hierarchical object detection for very high-resolution satellite images	0	0.34	2021
Semi-supervised multi-Layer convolution kernel learning in credit evaluation	0	0.34	2021
Selecting a diverse set of benchmark instances from a tunable model problem for black-box Discrete Optimization Algorithms	1	0.34	2020
Implementation issues in optimization algorithms: do they matter?	0	0.34	2019
An Improved Generic Bet-and-Run Strategy with Performance Prediction for Stochastic Local Search	0	0.34	2019
A Branch-and-Bound-Based Crossover Operator for the Traveling Salesman Problem	0	0.34	2019
Energy-Efficient Load Balancing Ant Based Routing Algorithm For Wireless Sensor Networks	6	0.46	2019
Difficult features of combinatorial optimization problems and the tunable w-model benchmark problem for simulating them.	1	0.35	2018
An Improved Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search.	0	0.34	2018
Workshops at PPSN 2018.	0	0.34	2018
Automatically discovering clusters of algorithm and problem instance behaviors as well as their causes from experimental data, algorithm setups, and instance features.	4	0.42	2018
A generic problem instance generator for discrete optimization problems.	0	0.34	2018
Optimization Algorithm Behavior Modeling: A Study On The Traveling Salesman Problem	0	0.34	2018
Combining two local searches with crossover: an efficient hybrid algorithm for the traveling salesman problem.	1	0.36	2017
Modeling optimization algorithm runtime behavior and its applications.	1	0.35	2017
Hybridizing Different Local Search Algorithms with Each Other and Evolutionary Computation: Better Performance on the Traveling Salesman Problem.	2	0.36	2016
Tackling Common Due Window Problem with a Two-Layered Approach.	0	0.34	2016
Global versus local search: the impact of population sizes on evolutionary algorithm performance.	6	0.42	2016
An alternative way of presenting statistical test results when evaluating the performance of stochastic approaches.	3	0.37	2015
Local search for the Traveling Salesman Problem: A comparative study	5	0.44	2015
Hybrid Paco With Enhanced Pheromone Initialization For Solving The Vehicle Routing Problem With Time Windows	0	0.34	2015
Hybrid Ejection Chain Methods for the Traveling Salesman Problem.	4	0.39	2015
An efficient local search heuristic with row weighting for the unicost set covering problem.	11	0.62	2015
An Investigation of Hybrid Tabu Search for the Traveling Salesman Problem.	6	0.47	2015
A weighting-based local search heuristic algorithm for the Set Covering Problem	3	0.37	2014
Frequency Fitness Assignment	3	0.39	2014
Multiobjective genetic programming for maximizing ROC performance	19	0.59	2014
Comparing a hybrid branch and bound algorithm with evolutionary computation methods, local search and their hybrids on the TSP	5	0.44	2014
Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem	2	0.36	2014
Improve the 3-flip Neighborhood Local Search by Random Flat Move for the Set Covering Problem.	0	0.34	2014
Common due-window problem: Polynomial algorithms for a given processing sequence	0	0.34	2014
Fitness level based adaptive operator selection for cutting stock problems with contiguity	0	0.34	2014
Evolving exact integer algorithms with Genetic Programming	0	0.34	2014
A New Memetic Algorithm With Fitness Approximation for the Defect-Tolerant Logic Mapping in Crossbar-Based Nanoarchitectures	15	0.58	2013
Fixed-point digital IIR filter design using two-stage ensemble evolutionary algorithm	4	0.40	2013
Two-stage ensemble memetic algorithm: Function optimization and digital IIR filter design	16	0.57	2013
SDGP: A developmental approach for traveling salesman problems	1	0.34	2013
A developmental solution to (dynamic) capacitated arc routing problems using genetic programming	4	0.45	2012
A study on scalable representations for evolutionary optimization of ground structures.	10	0.69	2012
Evolutionary Optimization: Pitfalls and Booby Traps	41	1.37	2012
Special issue on modern search heuristics and applications	2	0.37	2011
A Framework for Multi-model EDAs with Model Recombination	3	0.36	2011
Perspectives on the Field of Cognitive Informatics and its Future Development	40	1.58	2011
Self-adaptive learning based particle swarm optimization	123	3.43	2011
Margin-based over-sampling method for learning from imbalanced datasets	12	0.58	2011

1
2
50 / page