8512 search results - page 1390 / 1703 » Computing Theory With Relevance |
209
click to vote
IDTRUST
2009
ACM
16 years 1 months ago
2009
ACM
We introduce a formal semantics based calculus of trust that explicitly represents trust and quantifies the risk associated with trust in public key infrastructure (PKI) and iden...
155
click to vote
HIPEAC
2009
Springer
16 years 1 months ago
2009
Springer
Power consumption has emerged as a key design concern across the entire computing range, from low-end embedded systems to high-end supercomputers. Understanding the power character...
188
click to vote
IPSN
2009
Springer
16 years 1 months ago
2009
Springer
As the diversity of sensornet use cases increases, the combinations of environments and applications that will coexist will make custom engineering increasingly impractical. We in...
182
Voted
LATA
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
179
Voted
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...