2693 search results - page 358 / 539 » On Computing Complex Navigation Functions |
207
click to vote
DAWAK
2001
Springer
15 years 11 months ago
2001
Springer
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...
197
click to vote
DAC
1998
ACM
15 years 10 months ago
1998
ACM
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
160
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
188
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Alternative representations of biochemical networks emphasise different aspects of the data and contribute to the understanding of complex biological systems. In this ...
179
click to vote
ISPA
2005
Springer
15 years 12 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...