1805 search results - page 148 / 361 » A Theory of Closure Operators |
165
click to vote
ASIAN
2006
Springer
15 years 10 months ago
2006
Springer
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
182
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
211
click to vote
ASE
2005
15 years 6 months ago
2005
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
165
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
We present a programming language for implementing multiagent systems consisting of a set of individual agents that interact with a computational organization specified in terms ...
175
click to vote
INFOCOM
2007
IEEE
16 years 28 days ago
2007
IEEE
— Many network operators offer some type of tiered service, in which users may select only from a small set of service levels (tiers). Such a service has the potential to simplif...