Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 207,943,776 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

Multiobjective Optimization, Models and Applications.- A Novel Smart Multi-Objective Particle Swarm Optimisation Using…

Highly Cited

2005

Highly Cited

2005

The Problem of minimizing the bandwidth of the nonzero entries of a sparse symmetric matrix by permuting its rows and columns and…

Highly Cited

2005

Highly Cited

2004

Highly Cited

2004

Previous proposals for implementing instruction-level temporal redundancy in out-of-order cores have reported a performance…

Highly Cited

1995

Highly Cited

1995

The Constraint Satisfaction Problem is a type of combinatorial search problem of much interest in Artificial Intelligence and…

Highly Cited

1993

Highly Cited

1993

The design and implementation of a software decoder for MPEG video bitstreams is described. The software has been ported to…

1993

1993

High-performance scalar processors are characterized by multiple pipelined functional units that can be initiated simultaneously…

Highly Cited

1989

Highly Cited

1989

Systolic VLSI architectures for implementing the full-search block-matching algorithm are described. A large range of data rates…

Review

1982

Review

1982

The bandwidth problem for a graph G is to label its n vertices vi with distinct integers f(vi) so that the quantity max{| f(vi…

Highly Cited

1978

Highly Cited

1978

We present a linear-time algorithm for sparse symmetric matrices which converts a matrix into pentadiagonal form (“bandwidth 2…