Sciweavers

849 search results - page 137 / 170
» The Early Restart Algorithm
Sort
View
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 2 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
LPAR
1999
Springer
14 years 27 days ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies
DKE
2008
79views more  DKE 2008»
13 years 8 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
TCAD
2008
195views more  TCAD 2008»
13 years 8 months ago
Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu, Meng-X...