Sciweavers

12659 search results - page 2230 / 2532
» The distributed breakout algorithms
Sort
View
ENTCS
2007
84views more  ENTCS 2007»
15 years 6 months ago
A Rewriting Logic Framework for Soft Constraints
Soft constraints extend classical constraints to deal with non-functional requirements, overconstrained problems and preferences. Bistarelli, Montanari and Rossi have developed a ...
Martin Wirsing, Grit Denker, Carolyn L. Talcott, A...
JSA
2006
113views more  JSA 2006»
15 years 6 months ago
A power-efficient TCAM architecture for network forwarding tables
Stringent memory access and search speed requirements are two of the main bottlenecks in wire speed processing. Most viable search engines are implemented in content addressable m...
Taskin Koçak, Faysal Basci
JSAC
2006
104views more  JSAC 2006»
15 years 6 months ago
Queue Proportional Scheduling via Geometric Programming in Fading Broadcast Channels
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is presented via geometric programming (GP). QPS finds a data ...
Kibeom Seong, Ravi Narasimhan, John M. Cioffi
JSAC
2006
137views more  JSAC 2006»
15 years 6 months ago
Adaptive Defense Against Various Network Attacks
In defending against various network attacks, such as distributed denial-of-service (DDoS) attacks or worm attacks, a defense system needs to deal with various network conditions a...
Cliff Changchun Zou, Nick G. Duffield, Donald F. T...
NECO
2008
170views more  NECO 2008»
15 years 6 months ago
Representational Power of Restricted Boltzmann Machines and Deep Belief Networks
Deep Belief Networks (DBN) are generative neural network models with many layers of hidden explanatory factors, recently introduced by Hinton et al., along with a greedy layer-wis...
Nicolas Le Roux, Yoshua Bengio
« Prev « First page 2230 / 2532 Last » Next »