13376 search results - page 257 / 2676 » Problem Solving with |
133
Voted
GMP
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper summarizes a series of recent research results made at Edinburgh University based on projects that apply domain knowledge of standard shapes and relationships to solve ...
95
Voted
MOC
2000
15 years 3 months ago
2000
In this paper, we consider iterative algorithms of Uzawa type for solving linear nonsymmetric saddle point problems. Specifically, we consider systems, written as usual in block fo...
139
Voted
COCO
2004
Springer
15 years 7 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
140
Voted
PDP
2003
IEEE
15 years 9 months ago
2003
IEEE
The paper presents a Coarse-Grained Multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with È processors in ...
120
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and ...