Sciweavers

5962 search results - page 146 / 1193
» Efficient Clustering for Orders
Sort
View
JPDC
2008
92views more  JPDC 2008»
15 years 6 months ago
Techniques for pipelined broadcast on ethernet switched clusters
By splitting a large broadcast message into segments and broadcasting the segments in a pipelined fashion, pipelined broadcast can achieve high performance in many systems. In thi...
Pitch Patarasuk, Xin Yuan, Ahmad Faraj
IDEAS
2006
IEEE
104views Database» more  IDEAS 2006»
16 years 17 days ago
Exploiting Indifference for Customization of Partial Order Skylines
Unlike numerical preferences, preferences on attribute values do not show an inherent total order, but skyline computation has to rely on partial orderings explicitly stated by th...
Wolf-Tilo Balke, Ulrich Güntzer, Wolf Sibersk...
GLVLSI
2002
IEEE
95views VLSI» more  GLVLSI 2002»
15 years 11 months ago
Term ordering problem on MDG
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...
Yi Feng, Eduard Cerny
KR
2000
Springer
15 years 10 months ago
Reduction rules and universal variables for first order tableaux and DPLL
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implem...
Fabio Massacci
RECOMB
2005
Springer
16 years 6 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...