#### Filter Results:

- Full text PDF available (1)

#### Publication Year

2013

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Zongxu Mu, Holger H. Hoos
- IJCAI
- 2015

The time complexity of problems and algorithms, i.e., the scaling of the time required for solving a problem instance as a function of instance size, is of key interest in theoretical computer science and practical applications. In this context, propositional satisfiability (SAT) is one of the most intensely studied problems, and it is generally believed… (More)

- Zongxu Mu, Minming Li
- COCOON
- 2013

- Zongxu Mu, Holger H. Hoos, Thomas Stützle
- LION
- 2016

- Zongxu Mu, Holger H. Hoos
- GECCO
- 2015

The time complexity of problems and algorithms, i.e., the scaling of the time required for solving a problem instance as a function of instance size, is of key interest in theoretical computer science and practical applications. This paper presents an automated tool -- Empirical Scaling Analyser (ESA) -- that is designed to perform empirical scaling… (More)

- ‹
- 1
- ›