Sciweavers

2231 search results - page 307 / 447
» Alternation as a programming paradigm
Sort
View
COCOON
2010
Springer
15 years 5 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen
IFM
2010
Springer
124views Formal Methods» more  IFM 2010»
15 years 5 months ago
Safe Commits for Transactional Featherweight Java
Abstract. Transactions are a high-level alternative for low-level concurrencycontrol mechanisms such as locks, semaphores, monitors. A recent proposal for integrating transactional...
Thi Mai Thuong Tran, Martin Steffen
WIOPT
2010
IEEE
15 years 4 months ago
Iterative power and subcarrier allocation for maximizing WSMR in cellular OFDMA systems
We consider the resource allocation (RA) problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each ba...
Tao Wang, Luc Vandendorpe
ICPPW
2009
IEEE
15 years 4 months ago
Characterizing the Performance of
Using Linux for high-performance applications on the compute nodes of IBM Blue Gene/P is challenging because of TLB misses and difficulties with programming the network DMA engine...
Kazutomo Yoshii, Kamil Iskra, Harish Naik, Pete Be...
COMMA
2010
15 years 1 months ago
Dialectical Proofs for Constrained Argumentation
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
Caroline Devred, Sylvie Doutre, Claire Lefè...