30 search results - page 3 / 6 » Effective complexity of stationary process realizations |
SIGMOD
2010
ACM
13 years 4 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
SBBD
2004
13 years 7 months ago
2004
Today, neither transactional provisions, in general, nor concurrency control, in particular, of DBMS-based processing are tailored to the specific needs of large and collaborative...
ICC
2007
IEEE
14 years 15 days ago
2007
IEEE
— Interleave division multiple access (IDMA) recently attracted many research activities because of its excellent performance despite its reasonable low complexity. The low compl...
IEAAIE
2001
Springer
13 years 10 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
CIMCA
2008
IEEE
14 years 20 days ago
2008
IEEE
Cooperation is the process of synchronization and exchanging useful knowledge between agents in multiagent systems. Since cooperation associates agents into a collaborative team t...