Sciweavers

29 search results - page 1 / 6
» All triples for orthogonal designs of order 40
Sort
View
DM
2008
63views more  DM 2008»
13 years 4 months ago
All triples for orthogonal designs of order 40
The use of amicable sets of eight circulant matrices and four negacyclic matrices to generate orthogonal designs is relatively new. We find all 1841 possible orthogonal designs of...
Wolf H. Holzmann, Hadi Kharaghani, Behruz Tayfeh-R...
WWW
2004
ACM
14 years 5 months ago
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Centralized Resource Description Framework (RDF) repositories have limitations both in their failure tolerance and in their scalability. Existing Peer-to-Peer (P2P) RDF repositori...
Min Cai, Martin R. Frank
SBACPAD
2005
IEEE
139views Hardware» more  SBACPAD 2005»
13 years 10 months ago
Chained In-Order/Out-of-Order DoubleCore Architecture
Complexity is one of the most important problems facing microarchitects. It is exacerbated by the application of optimizations, by scaling to higher issue widths and, in general, ...
Miquel Pericàs, Adrián Cristal, Rube...
DM
2002
114views more  DM 2002»
13 years 4 months ago
Existence of resolvable group divisible designs with block size four I
It is proved in this paper that for m 0; 2; 6; 10 (mod 12) there exists a resolvable group divisible design of order v, block size 4 and group size m if and only v 0 (mod 4), v ...
Hao Shen, Jiaying Shen
IJCAI
1989
13 years 6 months ago
Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of p...
Rina Dechter, Itay Meiri