Sciweavers

413 search results - page 4 / 83
» Are Hopfield Networks Faster than Conventional Computers
Sort
View
DAC
1996
ACM
15 years 10 months ago
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
Hiroyuki Higuchi, Yusuke Matsunaga
JSSPP
2005
Springer
15 years 11 months ago
Wave Scheduler: Scheduling for Faster Turnaround Time in Peer-Based Desktop Grid Systems
The recent success of Internet-based computing projects, coupled with rapid developments in peer-to-peer systems, has stimulated interest in the notion of harvesting idle cycles u...
Dayi Zhou, Virginia Mary Lo
289
Voted
ICDE
2006
IEEE
206views Database» more  ICDE 2006»
16 years 7 months ago
Query Co-Processing on Commodity Hardware
The rapid increase in the data volumes for the past few decades has intensified the need for high processing power for database and data mining applications. Researchers have acti...
Anastassia Ailamaki, Naga K. Govindaraju, Dinesh M...
HIS
2001
15 years 7 months ago
Global Optimisation of Neural Networks Using a Deterministic Hybrid Approach
Selection of the topology of a neural network and correct parameters for the learning algorithm is a tedious task for designing an optimal artificial neural...
Gleb Beliakov, Ajith Abraham
DAC
2003
ACM
16 years 6 months ago
Random walks in a supply network
This paper presents a power grid analyzer based on a random walk technique. A linear-time algorithm is first demonstrated for DC analysis, and is then extended to perform transien...
Haifeng Qian, Sani R. Nassif, Sachin S. Sapatnekar