596 search results - page 71 / 120 » Complexity Analysis by Graph Rewriting |
OOPSLA
2010
Springer
13 years 6 months ago
2010
Springer
Domain-specific languages offer high expressive power foa particular problem domain, abstracting over the accidental complexity associated with traditional software development. ...
CN
2008
13 years 8 months ago
2008
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
TALG
2008
13 years 8 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
DKE
2006
13 years 8 months ago
2006
The last few years, there has been an extensive body of literature in data warehousing applications that primarily focuses on basket-type (transactional) data, common in retail in...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...