Sciweavers

3616 search results - page 36 / 724
» Conditional Memory Ordering
Sort
View
151
Voted
LORI
2009
Springer
15 years 9 months ago
First-Order Logic Formalisation of Arrow's Theorem
Arrow’s Theorem is a central result in social choice theory. It states that, under certain natural conditions, it is impossible to aggregate the preferences of a finite set of i...
Umberto Grandi, Ulle Endriss
114
Voted
LFCS
2007
Springer
15 years 8 months ago
Density Elimination and Rational Completeness for First-Order Logics
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
Agata Ciabattoni, George Metcalfe
133
Voted
WMPI
2004
ACM
15 years 7 months ago
An analytical model for software-only main memory compression
Abstract. Many applications with large data spaces that cannot run on a typical workstation (due to page faults) call for techniques to expand the effective memory size. One such t...
Irina Chihaia, Thomas R. Gross
RTCSA
2005
IEEE
15 years 8 months ago
Task Partitioning upon Memory-Constrained Multiprocessors
Most prior theoretical research on partitioning algorithms for real-time multiprocessor platforms has focused on ensuring that the cumulative computing requirements of the tasks a...
Nathan Fisher, James H. Anderson, Sanjoy K. Baruah
ISIPTA
2003
IEEE
15 years 7 months ago
On the Symbiosis of Two Concepts of Conditional Interval Probability
This paper argues in favor of the thesis that two different concepts of conditional interval probability are needed, in order to serve the huge variety of tasks conditional probab...
Kurt Weichselberger, Thomas Augustin