Sciweavers

723 search results - page 68 / 145
» Reducing the complexity of the issue logic
Sort
View
ARC
2011
Springer
270views Hardware» more  ARC 2011»
13 years 2 months ago
A Regular Expression Matching Circuit Based on a Decomposed Automaton
In this paper, we propose a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert regular expr...
Hiroki Nakahara, Tsutomu Sasao, Munehiro Matsuura
ANNS
2010
13 years 2 months ago
Search Space Restriction of Neuro-evolution through Constrained Modularization of Neural Networks
Evolving recurrent neural networks for behavior control of robots equipped with larger sets of sensors and actuators is difficult due to the large search spaces that come with the ...
Christian W. Rempis, Frank Pasemann
SOFSEM
2007
Springer
14 years 1 months ago
Explicit Connectors in Component Based Software Engineering for Distributed Embedded Systems
Abstract. The increasing complexity of today’s embedded systems applications imposes the requirements and constraints of distributed, heterogeneous subsystem interaction to softw...
Dietmar Schreiner, Karl M. Göschka
COMSWARE
2006
IEEE
14 years 1 months ago
Separating control software from routers
Abstract— Control software in routers have gotten increasingly complex today. Further, since the control software runs in every router, managing a large network of routers is com...
Ramachandran Ramjee, Furquan Ansari, Martin Havema...
ICS
2004
Tsinghua U.
14 years 1 months ago
Cluster prefetch: tolerating on-chip wire delays in clustered microarchitectures
The growing dominance of wire delays at future technology points renders a microprocessor communication-bound. Clustered microarchitectures allow most dependence chains to execute...
Rajeev Balasubramonian