4345 search results - page 221 / 869 » Temporal Constraint Networks |
160
click to vote
INFOCOM
1998
IEEE
1998
IEEE
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
15 years 10 months ago
-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward para...
201
click to vote
FPGA
2008
ACM
15 years 7 months ago
2008
ACM
Look-up table based FPGAs have migrated from a niche technology for design prototyping to a valuable end-product component and, in some cases, a replacement for general purpose pr...
140
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
166
click to vote
IJCNN
2008
IEEE
16 years 18 days ago
2008
IEEE
— Spiking neural networks have been shown capable of simulating sigmoidal artificial neural networks providing promising evidence that they too are universal function approximat...
155
click to vote
INFOCOM
2008
IEEE
16 years 18 days ago
2008
IEEE
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...