332 search results - page 4 / 67 » Complexity analysis of a decentralised graph colouring algor... |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
FUIN
2007
13 years 7 months ago
2007
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
ACSC
2010
IEEE
13 years 2 months ago
2010
IEEE
One of the major challenges facing a present day game development company is the removal of bugs from such complex virtual environments. This work presents an approach for measuri...
IBPRIA
2003
Springer
14 years 25 days ago
2003
Springer
In this paper we present an environment for the tracking of a human face obtained from a real video sequence. We will describe the system and discuss the advantages and disadvanta...
JACM
2000
13 years 7 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...