Sciweavers

3228 search results - page 296 / 646
» Computationally Sound Proofs
Sort
View
IJFCS
2011
78views more  IJFCS 2011»
14 years 11 months ago
P Systems and Topology: Some Suggestions for Research
some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to pology. In turn, the ...
Pierluigi Frisco, Hendrik Jan Hoogeboom
FOSSACS
2004
Springer
15 years 10 months ago
Choice in Dynamic Linking
We introduce a computational interpretation for Hilbert’s choice operator (ε). This interpretation yields a typed foundation for dynamic linking in software systems. The use of ...
Martín Abadi, Georges Gonthier, Benjamin We...
COMPUTING
2007
78views more  COMPUTING 2007»
15 years 4 months ago
Calculating lower bounds for caching problems
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For we...
Leah Epstein, Rob van Stee
MSCS
2006
89views more  MSCS 2006»
15 years 4 months ago
Quantum weakest preconditions
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
Ellie D'Hondt, Prakash Panangaden
ADHOCNOW
2009
Springer
15 years 11 months ago
Optimal and Fair Transmission Rate Allocation Problem in Multi-hop Cellular Networks
We deal with the rate allocation problem for downlink in a Multi-hop Cellular Network. A mathematical model is provided to assign transmission rates in order to reach an optimal an...
Cristiana Gomes, Jérôme Galtier