1299 search results - page 57 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
170
click to vote
ICCS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
175
click to vote
HIPC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
174
click to vote
ACSC
2004
IEEE
15 years 9 months ago
2004
IEEE
When modern processors keep increasing the instruction window size and the issue width to exploit more instruction-level parallelism (ILP), the demand of larger physical register ...
156
click to vote
ISAAC
2009
Springer
16 years 16 days ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
163
click to vote
CAV
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...