102 search results - page 17 / 21 » Verifying space and time requirements for resource-bounded a... |
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
SELMAS
2004
Springer
15 years 2 months ago
2004
Springer
If agents are to negotiate automatically with one another they must share a negotiation mechanism, specifying what possible actions each party can take at any given time, when nego...
SSD
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we study the evaluation of continuous constraint queries (CCQs) for spatiotemporal streams. A CCQ triggers an alert whenever a configuration of constraints between s...
ECAL
2005
Springer
15 years 3 months ago
2005
Springer
Efficient hierarchical architectures for reconfigurable and adaptive multi-agent networks require dynamic cluster formation among the set of nodes (agents). In the absence of cen...