Sciweavers

2473 search results - page 268 / 495
» The Logic of Communication Graphs
Sort
View
ATAL
2005
Springer
16 years 6 days ago
From concepts to agents: towards a framework for multi-agent system modelling
Whilst tools assist the various tasks required to develop a multi-agent system (MAS), yet there still remains a gap between the generation of MAS models and program code. AUML dev...
Richard Hill, Simon Polovina, Martin D. Beer
FOCS
2003
IEEE
15 years 12 months ago
Quantum Search of Spatial Regions
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
Scott Aaronson, Andris Ambainis
APSEC
1997
IEEE
15 years 11 months ago
A Test-case Generation Method for Concurrent Programs Including Task-types
A task-type in concurrent programs is a template of task-instances which are dynamically generated in execution of the programs. The number of the generated taskinstances may not ...
Tetsuro Katayama, Zengo Furukawa, Kazuo Ushijima
PODC
2010
ACM
15 years 10 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
FUIN
2008
98views more  FUIN 2008»
15 years 6 months ago
A Restarted Strategy for Efficient Subsumption Testing
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
Ondrej Kuzelka, Filip Zelezný