4112 search results - page 26 / 823 » Efficient Algorithms for the Spoonerism Problem |
160
click to vote
TAINN
2005
Springer
15 years 7 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
184
Voted
IJIT
2004
15 years 3 months ago
2004
Cryptarithmetic problem is an interesting constraint satisfaction problem for which different algorithms have been given. But none of them can solve the problem intelligently using...
84
Voted
INFORMATICALT
2006
15 years 1 months ago
2006
Three parallel algorithms for solving the 3D problem with nonlocal boundary condition are considered. The forward and backward Euler finite-difference schemes, and LOD scheme are t...
111
click to vote
EOR
2006
15 years 1 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
128
Voted
JALC
2002
15 years 1 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...