Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Luc T. Wille

dblp:51/6674 · also L. T. Wille · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1996
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 50% Mathematical optimization · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › covering codes
binary covering codes
0.011996
New binary covering codes obtained by simulated annealing · IEEE Trans. Inf. Theory 1996
Mathematical optimization
combinatorial optimization
0.011996
New binary covering codes obtained by simulated annealing · IEEE Trans. Inf. Theory 1996
Coding theory
covering codes
0.011996
New binary covering codes obtained by simulated annealing · IEEE Trans. Inf. Theory 1996
Mathematical optimization › metaheuristic optimization
simulated annealing
0.011996
New binary covering codes obtained by simulated annealing · IEEE Trans. Inf. Theory 1996

Methods — techniques the papers use, named apart from their topics

simulated annealing · 0.0
YearPublicationVenuePosition
1996 New binary covering codes obtained by simulated annealing
abstract
New binary covering codes of radius 1, obtained by simulated annealing, are presented. These constructions establish that K(9, 1)/spl les/62 and K(12, 1)/spl les/380. The article is concerned with finding upper bounds on K(n,R), the minimum cardinality of any binary code of length n and with covering radius R.
Luc T. Wille
IEEE Trans. Inf. Theory1
1994 Towards first-principles theories of materials and biological systems - The need for massive parallelism
Luc T. Wille, J. L. Rogers, C. P. Burmester, R. Gronsky
Future Gener. Comput. Syst.1