Sciweavers

131 search results - page 26 / 27
» On the k-additive Core of Capacities
Sort
View
EUSFLAT
2007
107views Fuzzy Logic» more  EUSFLAT 2007»
13 years 6 months ago
Extending the Choquet integral
In decision under uncertainty, the Choquet integral yields the expectation of a random variable with respect to a fuzzy measure (or non-additive probability or capacity). In gener...
Giovanni Rossi
SIGCOMM
2010
ACM
13 years 5 months ago
Greening backbone networks: reducing energy consumption by shutting off cables in bundled links
In backbone networks, the line cards that drive the links between neighboring routers consume a large amount of energy. Since these networks are typically overprovisioned, selecti...
Will Fisher, Martin Suchara, Jennifer Rexford
SIGCOMM
2010
ACM
13 years 5 months ago
Source flow: handling millions of flows on flow-based nodes
Flow-based networks such as OpenFlow-based networks have difficulty handling a large number of flows in a node due to the capacity limitation of search engine devices such as tern...
Yasunobu Chiba, Yusuke Shinohara, Hideyuki Shimoni...
TPDS
2008
124views more  TPDS 2008»
13 years 5 months ago
TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...
János Tapolcai, Pin-Han Ho, Anwar Haque
MAM
2007
157views more  MAM 2007»
13 years 5 months ago
Executing large algorithms on low-capacity FPGAs using flowpath partitioning and runtime reconfiguration
This paper describes a new method of executing a software program on an FPGA for embedded systems. Rather than combine reconfigurable logic with a microprocessor core, this method...
Darrin M. Hanna, Michael DuChene