2023 - Research.com Computer Science in Australia Leader Award
2020 - ACM Fellow For contributions to artificial intelligence
Toby Walsh mostly deals with Mathematical optimization, Artificial intelligence, Algorithm, Constraint satisfaction and Constraint satisfaction problem. His Mathematical optimization research is multidisciplinary, incorporating elements of Computational complexity theory, Graph, Local consistency and Conjecture. His biological study spans a wide range of topics, including Discrete mathematics and Backtracking.
Toby Walsh combines subjects such as Programming language, Voting, Heuristics and True quantified Boolean formula with his study of Artificial intelligence. His study in the field of Satisfiability, Unit propagation and Iterative deepening depth-first search is also linked to topics like Branching. Toby Walsh has researched Constraint satisfaction in several fields, including Measure and Constraint programming.
His scientific interests lie mostly in Mathematical optimization, Theoretical computer science, Algorithm, Artificial intelligence and Local consistency. His Mathematical optimization research incorporates themes from Constraint programming, Consistency, Constraint satisfaction dual problem, Constraint satisfaction and Constraint satisfaction problem. His studies in Theoretical computer science integrate themes in fields like Computational complexity theory, Simple, Voting and Set.
The study incorporates disciplines such as Social choice theory and Mathematical economics in addition to Voting. His Time complexity, Satisfiability and Boolean satisfiability problem study are his primary interests in Algorithm. Much of his study explores Artificial intelligence relationship to Machine learning.
His main research concerns Fair division, Mathematical optimization, Mathematical economics, Artificial intelligence and Operations research. His Fair division research includes themes of Computational complexity theory, Simple, Competitive analysis and Data science. His research integrates issues of Time complexity, Outcome and Total cost in his study of Mathematical optimization.
His Time complexity research incorporates elements of Assignment problem and Theoretical computer science. His work in Artificial intelligence is not limited to one particular discipline; it also encompasses Marketing. His research in Operations research intersects with topics in Scheduling and Voting.
His primary areas of investigation include Mathematical economics, Artificial intelligence, Fair division, Mathematical optimization and Theoretical computer science. His work deals with themes such as Impossibility, Anti-plurality voting, Axiom and Voting, which intersect with Mathematical economics. He combines topics linked to Boolean satisfiability problem with his work on Artificial intelligence.
He focuses mostly in the field of Fair division, narrowing it down to topics relating to Competitive analysis and, in certain cases, Price of anarchy, Simple, Online model and Advice. The various areas that Toby Walsh examines in his Mathematical optimization study include Computational complexity theory, Stability, Resource allocation and Reduction. He combines subjects such as Small number, Time complexity, Structure, Control and Constraint learning with his study of Theoretical computer science.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Handbook of Constraint Programming
Francesca Rossi;Peter van Beek;Toby Walsh.
(2006)
Handbook of Satisfiability
Armin Biere;Marijn Heule;Hans van Maaren;Toby Walsh.
(2021)
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
A. Biere;M. Heule;H. van Maaren;T. Walsh.
(2009)
A theory of abstraction
Fausto Giunchiglia;Toby Walsh.
Artificial Intelligence (1992)
SATLIB: An Online Resource for Research on SAT
Holger H. Hoos;Thomas Stützle;I. Gent;H. Van Maaren.
theory and applications of satisfiability testing (2000)
SAT v CSP
Toby Walsh.
principles and practice of constraint programming (2000)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Francesca Rossi;Peter van Beek;Toby Walsh.
(2006)
Search in a Small World
Toby Walsh.
international joint conference on artificial intelligence (1999)
CSPLIB: A Benchmark Library for Constraints
Ian P. Gent;Toby Walsh.
principles and practice of constraint programming (1999)
Towards an understanding of hill-climbing procedures for SAT
Ian P. Gent;Toby Walsh.
national conference on artificial intelligence (1993)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
IBM (United States)
University of St Andrews
University of Edinburgh
Queen Mary University of London
University of Trento
ETH Zurich
Technical University of Berlin
University of Toronto
University of Waterloo
Carnegie Mellon University
University of Cambridge
Microsoft (United States)
Copenhagen Business School
University of California, Berkeley
City University of Hong Kong
University of Malaya
Duke University
Tel Aviv University
University of Connecticut
Agricultural Research Service
University of Toronto
University of Virginia
University of Tokushima
University of Graz
Harvard University
University of Burgundy