Skip to main content

Research Repository

Advanced Search

Outputs (29)

Multi-agent programming : languages, platforms and applications (2005)
Book
Bordini, R. H., Dastani, M., Dix, J., & El Fallah Seghrouchni, A. (Eds.). (2005). Multi-agent programming : languages, platforms and applications. Springer Verlag

The following text is taken from the publisher's website. "Multi-Agent Programming is an essential reference for anyone interested in the most up-to-date developments in MAS programming. While previous research has focused on the development of forma... Read More about Multi-agent programming : languages, platforms and applications.

Approximate counting and quantum computation (2005)
Journal Article
Bordewich, M., Freedman, M., Lovasz, L., & Welsh, D. (2005). Approximate counting and quantum computation. Combinatorics, Probability and Computing, 14(5-6), 737-754. https://doi.org/10.1017/s0963548305007005

Motivated by the result that an `approximate' evaluation of the Jones polynomial of a braid at a $5^{th}$ root of unity can be used to simulate the quantum part of any algorithm in the quantum complexity class BQP, and results relating BQP to the cou... Read More about Approximate counting and quantum computation.

Backdoor Sets for DLL Subsolvers (2005)
Journal Article
Szeider, S. (2005). Backdoor Sets for DLL Subsolvers. Journal of Automated Reasoning, 35(1-3), 73-88. https://doi.org/10.1007/s10817-005-9007-9

We study the parameterized complexity of detecting small backdoor sets for instances of the propositional satisfiability problem (SAT). The notion of backdoor sets has been recently introduced by Williams, Gomes, and Selman for explaining the ‘heavy-... Read More about Backdoor Sets for DLL Subsolvers.

Identifying phylogenetic trees (2005)
Journal Article
Bordewich, M., Huber, K., & Semple, C. (2005). Identifying phylogenetic trees. Discrete Mathematics, 300(1-3), 30-43. https://doi.org/10.1016/j.disc.2005.06.015

A central problem that arises in evolutionary biology is that of displaying partitions of subsets of a finite set X on a tree whose vertices are partially labelled with the elements of X. Such a tree is called an X-tree and, for a collection C of par... Read More about Identifying phylogenetic trees.

Virtual organization for realcourse (2005)
Book Chapter
Song, W., & Li, X. (2005). Virtual organization for realcourse. In A. Nilsson, R. Gustas, W. Wojtkowski, W. Wojtkowski, S. Wrycza, & J. Zupancic (Eds.), Advances in information system development : bridging the gap between academia & system development. Springer Verlag

Supermodular functions and the complexity of MAX CSP (2005)
Journal Article
Cohen, D., Cooper, M., Jeavons, P., & Krokhin, A. (2005). Supermodular functions and the complexity of MAX CSP. Discrete Applied Mathematics, 149(1-3), 53-72. https://doi.org/10.1016/j.dam.2005.03.003

In this paper we study the complexity of the maximum constraint satisfaction problem (MAX CSP) over an arbitrary finite domain. An instance of MAX CSP consists of a set of variables and a collection of constraints which are applied to certain specifi... Read More about Supermodular functions and the complexity of MAX CSP.

Jason and the Golden Fleece of agent-oriented programming (2005)
Book Chapter
Bordini, R. H., Hübner, J. F., & Vieira, R. (2005). Jason and the Golden Fleece of agent-oriented programming. In R. H. Bordini, M. Dastani, J. Dix, & A. El Fallah Seghrouchni (Eds.), Multi-agent programming : languages, platforms and applications (3-37). Springer Verlag