Skip to main content

Research Repository

Advanced Search

All Outputs (2741)

Simulating Errors in Web Services. (2004)
Journal Article
Looker, N., Munro, M., & Xu, J. (2004). Simulating Errors in Web Services. International journal of simulation: systems, science & technology, 5(5), 29-37

Complexity classification in qualitative temporal constraint reasoning (2004)
Journal Article
Jonsson, P., & Krokhin, A. (2004). Complexity classification in qualitative temporal constraint reasoning. Artificial Intelligence, 160(1-2), 35-51. https://doi.org/10.1016/j.artint.2004.05.010

We study the computational complexity of the qualitative algebra which is a temporal constraint formalism that combines the point algebra, the point-interval algebra and Allen's interval algebra. We identify all tractable fragments and show that ever... Read More about Complexity classification in qualitative temporal constraint reasoning.

Recognizing frozen variables in constraint satisfaction problems (2004)
Journal Article
Jonsson, P., & Krokhin, A. (2004). Recognizing frozen variables in constraint satisfaction problems. Theoretical Computer Science, 329(1-3), 93-113. https://doi.org/10.1016/j.tcs.2004.08.006

In constraint satisfaction problems over finite domains, some variables can be frozen, that is, they take the same value in all possible solutions. We study the complexity of the problem of recognizing frozen variables with restricted sets of constra... Read More about Recognizing frozen variables in constraint satisfaction problems.

GameOD: An Internet Based Game-On-Demand Framework (2004)
Presentation / Conference Contribution
Li, F., Lau, R., & Kilis, D. (2004). GameOD: An Internet Based Game-On-Demand Framework. In R. Lau, & G. Baciu (Eds.), . https://doi.org/10.1145/1077534.1077559

Multiplayer online 3D games are becoming very popular in recent years. However, existing games require the complete game content to be installed prior to game playing. Since the content is usually large in size, it may be difficult to run these games... Read More about GameOD: An Internet Based Game-On-Demand Framework.

The computational complexity of the elimination problem in generalized sports competitions (2004)
Journal Article
Kern, W., & Paulusma, D. (2004). The computational complexity of the elimination problem in generalized sports competitions. Discrete Optimization, 1(2), 205-214. https://doi.org/10.1016/j.disopt.2003.12.003

Consider a sports competition among various teams playing against each other in pairs (matches) according to a previously determined schedule. At some stage of the competition one may ask whether a particular team still has a (theoretical) chance to... Read More about The computational complexity of the elimination problem in generalized sports competitions.

Supporting Continuous Consistency in Multiplayer Online Games (2004)
Presentation / Conference Contribution
Li, F., Li, L., & Lau, R. (2004). Supporting Continuous Consistency in Multiplayer Online Games. . https://doi.org/10.1145/1027527.1027619

Multiplayer online games have become very popular in recent years. However, they generally suffer from network latency problem. If a player changes its states, it will take some time before the changes are reflected to other concurrent players. This... Read More about Supporting Continuous Consistency in Multiplayer Online Games.

On the support of recursive subdivision (2004)
Journal Article
Ivrissimtzis, I., Sabin, M., & Dodgson, N. (2004). On the support of recursive subdivision. ACM Transactions on Graphics, 23(4), 1043-1060. https://doi.org/10.1145/1027411.1027417

We study the support of subdivision schemes: that is, the region of the subdivision surface, which is affected by the displacement of a single control point. Our main results cover the regular case, where the mesh induces a regular Euclidean tessella... Read More about On the support of recursive subdivision.

Generating Regression Tests via Model Checking (2004)
Presentation / Conference Contribution
Xu, L., Dias, M., & Richardson, D. J. (2004). Generating Regression Tests via Model Checking. In 28th Annual International Computer Software and Applications Conference, COMPSAC 2004, 28-30 September 2004, Hong Kong ; proceedings (336-341). https://doi.org/10.1109/cmpsac.2004.1342855

During software maintenance, regression testing is an expensive but critical activity to ensure that modified versions of the system do not "regress". As software evolves, chances are that not only the implementation changes, but that the specificati... Read More about Generating Regression Tests via Model Checking.

Proving BDI properties of agent-oriented programming languages : the asymmetry thesis principles in AgentSpeak(L) (2004)
Journal Article
Bordini, R. H., & Moreira, A. F. (2004). Proving BDI properties of agent-oriented programming languages : the asymmetry thesis principles in AgentSpeak(L). Annals of Mathematics and Artificial Intelligence, 42(1-3), 197-226. https://doi.org/10.1023/b%3Aamai.0000034527.45635.e5

In this paper, we consider each of the nine BDI principles defined by Rao and Georgeff based on Bratman's asymmetry thesis, and we verify which ones are satisfied by Rao's AgentSpeak(L), a logic programming language inspired by the BDI architecture f... Read More about Proving BDI properties of agent-oriented programming languages : the asymmetry thesis principles in AgentSpeak(L).

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (2004)
Journal Article
Szeider, S. (2004). Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. Journal of Computer and System Sciences, 69(4), 656-674. https://doi.org/10.1016/j.jcss.2004.04.009

Recognition of minimal unsatisfiable CNF formulas (unsatisfiable CNF formulas which become satisfiable if any clause is removed) is a classical DP-complete problem. It was shown recently that minimal unsatisfiable formulas with n variables and n+k cl... Read More about Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable.

Some notes on interprocedural program slicing (2004)
Presentation / Conference Contribution
Gallagher, K. (2004). Some notes on interprocedural program slicing. . https://doi.org/10.1109/scam.2004.21

Weiser's algorithm for computing interprocedural slices has a serious drawback: it generates spurious criteria which are not feasible in the control flow of the program. When these extraneous criteria are used the slice becomes imprecise in that it h... Read More about Some notes on interprocedural program slicing.

An investigation on using web services for micro-payment (2004)
Presentation / Conference Contribution
Song, W., Chen, D., Chung, J., & Zhang, L. (2004). An investigation on using web services for micro-payment. In Web services : European conference, ECOWS 2004, 27-30 September 2004, Erfurt, Germany ; proceedings (213-226). https://doi.org/10.1007/b100919

E-commerce development and applications have been bringing the Internet to business and marketing and reforming our current business styles and processes. As Business to Business (B2B) has been a main stream of the e-commerce activities for a decade,... Read More about An investigation on using web services for micro-payment.

Counting Consistent Phylogenetic Trees is #P-complete (2004)
Journal Article
Bordewich, M., Semple, C., & Talbot, J. (2004). Counting Consistent Phylogenetic Trees is #P-complete. Advances in Mathematics, 33(2), 416-430. https://doi.org/10.1016/j.aam.2003.08.006

Reconstructing phylogenetic trees is a fundamental task in evolutionary biology. Various algorithms exist for this purpose, many of which come under the heading of `supertree methods'. These methods amalgamate a collection Ρ of phylogenetic trees int... Read More about Counting Consistent Phylogenetic Trees is #P-complete.

State-space reduction techniques in agent verification (2004)
Presentation / Conference Contribution
Bordini, R. H., Fisher, M., Visser, W., Wooldridge, M., Jennings, N. R., Sierra, C., …Tambe, M. (2004). State-space reduction techniques in agent verification. In Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004, 19-23 July 2004, New York ; proceedings (896-903). https://doi.org/10.1109/aamas.2004.242630

We have developed a set of tools to allow the use of model-checking techniques for the verification of systems directly implemented in an agent-oriented programming language. The success of model checking as a verification technique for large systems... Read More about State-space reduction techniques in agent verification.

A maximal tractable class of soft constraints (2004)
Journal Article
Cohen, D., Cooper, M., Jeavons, P., & Krokhin, A. (2004). A maximal tractable class of soft constraints. Journal of Artificial Intelligence Research, 22, 1-22. https://doi.org/10.1613/jair.1400

Many researchers in artificial intelligence are beginning to explore the use of soft constraints to express a set of (possibly conflicting) problem requirements. A soft constraint is a function defined on a collection of variables which associates so... Read More about A maximal tractable class of soft constraints.

Amalgamations of factorizations of complete equipartite graphs, (2004)
Journal Article
Hilton, A., & Johnson, M. (2004). Amalgamations of factorizations of complete equipartite graphs,. Discrete Mathematics, 284(1-3), 157-175. https://doi.org/10.1016/j.disc.2003.11.030

Let t be a positive integer, and let L=(l1,…,lt) and K=(k1,…,kt) be collections of nonnegative integers. A graph has a (t,K,L) factorization if it can be represented as the edge-disjoint union of factors F1,…,Ft where, for 1it, Fi is ki-regular and a... Read More about Amalgamations of factorizations of complete equipartite graphs,.

Using web service technologies to create an information broker : an experience report. (2004)
Presentation / Conference Contribution
Turner, M., Zhu, F., Kotsiopoulos, I., Russell, M., Budgen, D., Bennett, K., …Rigby, M. (2004). Using web service technologies to create an information broker : an experience report.

This paper reports on our experiences with using the emerging web service technologies and tools to create a demonstration information broker system as part of our research into information management in a distributed environment. To provide a realis... Read More about Using web service technologies to create an information broker : an experience report..