Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Expensive Multiobjective Optimization by MOEA/D With Gaussian Process Model
This map shows the geographic impact of Edward Tsang's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Edward Tsang with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Edward Tsang more than expected).
This network shows the impact of papers produced by Edward Tsang. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Edward Tsang. The network helps show where Edward Tsang may publish in the future.
Co-authorship network of co-authors of Edward Tsang
This figure shows the co-authorship network connecting the top 25 collaborators of Edward Tsang.
A scholar is included among the top collaborators of Edward Tsang based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Edward Tsang. Edward Tsang is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Rashidi, Hassan & Edward Tsang. (2015). Vehicle Scheduling in Port Automation: Advanced Algorithms for Minimum Cost Flow Problems. CRC Press eBooks.10 indexed citations
2.
Fasli, Maria, et al.. (2013). Stylized Facts of the FX Market Transactions Data: An Empirical Study. Open Access at Essex (University of Essex). 2(4). 1–9.5 indexed citations
3.
Rashidi, Hassan & Edward Tsang. (2009). An Efficient Extension of Network Simplex Algorithm. SHILAP Revista de lepidopterología.1 indexed citations
4.
Alexandrova‐Kabadjova, Biliana, Andreas Krause, & Edward Tsang. (2007). An Agent-Based Model of Interactions in the Payment Card Market. SSRN Electronic Journal.1 indexed citations
5.
Jin, Nanlin, et al.. (2004). Population Based Incremental Learning Versus Genetic Algorithms: Iterated Prisoners Dilemma. Northumbria Research Link (Northumbria University).13 indexed citations
Jin, Li & Edward Tsang. (2000). REDUCING FAILURES IN INVESTMENT RECOMMENDATIONS USING GENETIC PROGRAMMING. RePEc: Research Papers in Economics.14 indexed citations
9.
Tsang, Edward, et al.. (1999). Improving Technical Analysis Predictions: An Application of Genetic Programming. The Florida AI Research Society. 108–112.40 indexed citations
10.
Freuder, Eugene C., Rina Dechter, Matthew L. Ginsberg, Bart Selman, & Edward Tsang. (1995). Systematic versus stochastic constraint satisfaction. International Joint Conference on Artificial Intelligence. 2027–2032.47 indexed citations
11.
Tsang, Edward, et al.. (1995). An attempt to map the performance of a range of algorithm and heuristic combinations.8 indexed citations
12.
Davenport, Andrew & Edward Tsang. (1995). An Empirical Investigation Into the Exceptionally Hard Problems.4 indexed citations
13.
Davenport, Andrew, et al.. (1994). GENET: a connectionist architecture for solving constraint satisfaction problems by iterative improvement. OpenGrey (Institut de l'Information Scientifique et Technique). 325–330.77 indexed citations
14.
Tsang, Edward, et al.. (1990). Applying genetic algorithms to constraint satisfaction optimization problems. OpenGrey (Institut de l'Information Scientifique et Technique). 649–654.12 indexed citations
15.
Tsang, Edward. (1989). Consistency and satisfiability in constraint satisfaction problems. 41–48.1 indexed citations
16.
Tsang, Edward. (1988). Elements in Temporal Reasoning in Planning.. European Conference on Artificial Intelligence. 94. 571–100.4 indexed citations
17.
Tsang, Edward. (1987). The consistent labeling problem in temporal reasoning. National Conference on Artificial Intelligence. 251–255.19 indexed citations
Tsang, Edward. (1987). Time structures for AI. International Joint Conference on Artificial Intelligence. 456–461.22 indexed citations
20.
Tsang, Edward. (1986). Plan Generation in a Temporal Frame.. European Conference on Artificial Intelligence. 643–657.9 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.