5372 search results - page 824 / 1075 » complexity 2007 |
214
click to vote
LADS
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Web applications represent an important category of applications that owe much of their popularity to the ubiquitous accessibility using standard web browsers. The comple...
154
click to vote
LFCS
2007
Springer
16 years 23 days ago
2007
Springer
LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikk...
187
click to vote
LFCS
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
153
click to vote
LPAR
2007
Springer
16 years 23 days ago
2007
Springer
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
186
click to vote
MATES
2007
Springer
16 years 23 days ago
2007
Springer
Developing agent applications is a complex and difficult task due to a variety of reasons. One key aspect making multi-agent systems more complicated than traditional applications ...