5608 search results - page 325 / 1122 » On the Theory of Matchgate Computations |
171
click to vote
GRC
2005
IEEE
16 years 11 days ago
2005
IEEE
An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. We compare the new approach with our previous nonincremental a...
168
click to vote
ATAL
2005
Springer
16 years 9 days ago
2005
Springer
Agents often want to protect private information, while at the same acting upon the information. These two desires are in conflict, and this conflict can be modeled in strategic...
140
click to vote
ATAL
2005
Springer
16 years 7 days ago
2005
Springer
We sketch how to express typical features of agent communication protocols in a simple temporal logic and show that conformance verification at runtime reduces to a generalised f...
154
click to vote
ESAW
2003
Springer
15 years 12 months ago
2003
Springer
We outline a model for a society of agents based upon one of the classical theories of sociology: The Weber’s model. We first investigate its links to agent technology through i...
167
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...