Sciweavers

2137 search results - page 353 / 428
» Proving Abstract Non-interference
Sort
View
ICMAS
2000
14 years 15 days ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge
SWAP
2007
14 years 9 days ago
Improving Responsiveness of Ontology-Based Query Formulation
Abstract. Recent research showed the benefits of adopting formal ontologies as a means for accessing heterogeneous data sources. The use of an ontology not only provides a uniform...
Ivan Zorzi, Sergio Tessaris, Paolo Dongilli
VISAPP
2007
14 years 9 days ago
Fourier signature in log-polar images
Abstract. In image-based robot navigation, the robot localises itself by comparing images taken at its current position with a set of reference images stored in its memory. The pro...
A. Gasperin, Carmelo Ardito, Enrico Grisan, Emanue...
ASPDAC
2008
ACM
106views Hardware» more  ASPDAC 2008»
14 years 8 days ago
Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proof
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
Udo Krautz, Markus Wedler, Wolfgang Kunz, Kai Webe...
ATAL
2010
Springer
14 years 8 days ago
Exploiting domain knowledge to improve norm synthesis
Social norms enable coordination in multiagent systems by constraining agent behaviour in order to achieve a social objective. Automating the design of social norms has been shown...
George Christelis, Michael Rovatsos, Ronald P. A. ...