Sciweavers

184 search results - page 6 / 37
» Using FPGAs to solve the Hamiltonian cycle problem
Sort
View
90
Voted
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
15 years 1 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi
USENIX
2000
14 years 11 months ago
MOSIX: How Linux Clusters Solve Real-World Problems
As the complexity of software increases, the size of the software tends to increase as well, which incurs longer compilation and build cycles. In this paper, the authors present o...
Steve McClure, Richard Wheeler
77
Voted
HICSS
1994
IEEE
149views Biometrics» more  HICSS 1994»
15 years 1 months ago
Stochastic Problem Solving by Local Computation Based on Self-Organization Paradigm
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
Yasusi Kanada, Masao Hirokawa
61
Voted
DESRIST
2009
Springer
102views Education» more  DESRIST 2009»
15 years 2 months ago
Design science as nested problem solving
Design science emphasizes the connection between knowledge and practice by showing that we can produce scientific knowledge by designing useful things. However, without further g...
Roel Wieringa
DELTA
2006
IEEE
15 years 1 months ago
Using Design Patterns to Overcome Image Processing Constraints on FPGAs
The mapping of image processing algorithms to hardware is complicated by several hardware constraints including limited processing time, limited access to data and limited resourc...
K. T. Gribbon, Donald G. Bailey, Christopher T. Jo...