9325 search results - page 406 / 1865 » The decentralized implementability problem |
138
click to vote
ECCV
1998
Springer
16 years 6 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
140
click to vote
CCS
2007
ACM
15 years 11 months ago
2007
ACM
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
175
click to vote
ATAL
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed senso...
128
Voted
ECAI
2000
Springer
15 years 9 months ago
2000
Springer
We argued in our Flexible Graphplan (FGP) work that the classical definition of the planning problem is too rigid to capture the full subtlety of many real problems. In light of t...
133
Voted
FPGA
2006
ACM
15 years 8 months ago
2006
ACM
While previous research has shown that FPGAs can efficiently implement many types of computations, their flexibility inherently limits their clock rate. Several research groups ha...