111 – 120 of 183
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2004
-
Mark
Approximation algorithms for Hamming clustering problems
- Contribution to journal › Article
-
Mark
A fast algorithm for approximating the detour of a polygonal chain
- Contribution to journal › Article
-
Mark
A new Q-learning algorithm based on the Metropolis criterion
(2004) In IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 34(5). p.2140-2143
- Contribution to journal › Article
-
Mark
Approximation algorithms for MAX-BISECTION on low degree regular graphs
- Contribution to journal › Article
-
Mark
Approximation and online algorithms with applications in robotics and computational biology
(2004)
- Thesis › Licentiate thesis
-
Mark
A fixed parameter algorithm for the minimum number convex partition problem
- Chapter in Book/Report/Conference proceeding › Book chapter
-
Mark
Distributed colouring and communication in rings with local knowledge
- Contribution to journal › Article
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Subexponential-time framework for optimal embeddings of graphs in integer lattices
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Tight time bounds for the minimum local convex partition problem
- Chapter in Book/Report/Conference proceeding › Book chapter
