1220 search results - page 97 / 244 » Restricting grammatical complexity |
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
CHES
2003
Springer
14 years 1 months ago
2003
Springer
For most of the time since they were proposed, it was widely believed that hyperelliptic curve cryptosystems (HECC) carry a substantial performance penalty compared to elliptic cur...
CP
1998
Springer
14 years 16 hour ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high co...
ASPDAC
2008
ACM
13 years 9 months ago
2008
ACM
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...