1888 search results - page 240 / 378 » Proof theory and computational analysis |
109
click to vote
MOBISYS
2003
ACM
16 years 1 months ago
2003
ACM
In this paper, we present a middleware architecture for coordination services in sensor networks that facilitates interaction between groups of sensors which monitor different env...
121
click to vote
ASM
2010
ASM
15 years 8 months ago
2010
ASM
Abstract. This paper introduces the subject of secrecy models development by transformation, with formal validation. In an enterprise, constructing a secrecy model is a participato...
109
click to vote
SAT
2009
Springer
15 years 8 months ago
2009
Springer
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
114
click to vote
ICPADS
2005
IEEE
15 years 7 months ago
2005
IEEE
We show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. We show that fro...
116
Voted
APLAS
2004
ACM
15 years 7 months ago
2004
ACM
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however e...