2035 search results - page 226 / 407 » On the complexity of stratified logics |
182
click to vote
IAT
2010
IEEE
15 years 4 months ago
2010
IEEE
As wireless sensor network applications grow in complexity, ad-hoc techniques are no longer adequate. Thus, it is crucial that these systems be adaptive and autonomous to remain f...
188
click to vote
IWSEC
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents efficient secure auction protocols for first price auction and second price auction. Previous auction protocols are based on a generally secure multi-party prot...
164
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
150
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates, as well as Boolean operations on regions, interpreted over low-...
160
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...