Sciweavers

7106 search results - page 750 / 1422
» Restricted Complexity, General Complexity
Sort
View
CORR
2006
Springer
110views Education» more  CORR 2006»
15 years 7 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...
DAM
2006
81views more  DAM 2006»
15 years 7 months ago
The satisfactory partition problem
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
ENTCS
2006
189views more  ENTCS 2006»
15 years 7 months ago
Variables as Resource for Shared-Memory Programs: Semantics and Soundness
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
Stephen D. Brookes
ET
2006
72views more  ET 2006»
15 years 7 months ago
Optimization of Test/Diagnosis/Rework Location(s) and Characteristics in Electronic System Assembly
In this paper, an optimization methodology is used to select the locations and characteristics of test, diagnosis and rework operations in electronic systems assembly processes. Re...
Zhen Shi, Peter Sandborn
FUIN
2006
88views more  FUIN 2006»
15 years 7 months ago
Calculi of Approximation Spaces
This paper considers the problem of how to establish calculi of approximation spaces. Approximation spaces considered in the context of rough sets were introduced by Zdzislaw Pawla...
Andrzej Skowron, Jaroslaw Stepaniuk, James F. Pete...