6142 search results - page 728 / 1229 » The Complexity of Partition Functions |
236
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...
218
click to vote
DAC
1998
ACM
15 years 11 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...
179
click to vote
PODC
2010
ACM
15 years 11 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 ...
209
click to vote
DOLAP
2006
ACM
15 years 10 months ago
2006
ACM
As more and more information is available on the web, it is a problem that many web resources are not accessible, i.e., are not usable for users with special needs. For example, f...
206
click to vote
ECAL
1995
Springer
15 years 10 months ago
1995
Springer
Arti cial Life and the more general area of Complex Systems does not have a uni ed theoretical framework although most theoretical work in these areas is based on simulation. This ...