2593 search results - page 3 / 519 » On Two Problems of Nano-PLA Design |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
SIROCCO
2004
13 years 7 months ago
2004
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a...
RC
2006
13 years 5 months ago
2006
The problem of designing robust controller for discrete two-time-scale interval systems, conveniently represented using interval matrix notion, is considered. The original full ord...
CSCW
2000
ACM
13 years 5 months ago
2000
ACM
The design of software toolkits embodies a fundamental tension. On the one hand, it aims to reduce programmer effort by providing prefabricated, reusable software modules encapsula...
NN
2008
Springer
13 years 5 months ago
2008
Springer
This paper presents two k-winners-take-all (k-WTA) networks with discontinuous activation functions. The k-WTA operation is first converted equivalently into linear and quadratic ...