838 search results - page 6 / 168 » Finding Optimal Solutions to Atomix |
115
Voted
SIAMSC
2008
15 years 1 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
129
click to vote
KR
2010
Springer
15 years 6 months ago
2010
Springer
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce th...
136
Voted
ALMOB
2006
15 years 1 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
137
Voted
ICPP
1993
IEEE
15 years 6 months ago
1993
IEEE
Optimal load allocation for load sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with fro...
CORR
2010
Springer
15 years 4 days ago
2010
Springer
: The paper introduces particle swarm optimization as a viable strategy to find numerical solution of Diophantine equation, for which there exists no general method of finding solu...