Sciweavers

225 search results - page 9 / 45
» Explicit Combinatorial Structures for Cooperative Distribute...
Sort
View
WETICE
1998
IEEE
14 years 1 months ago
Using a Groupware Space for Distributed Requirements Engineering
Requirements engineering (RE) is a necessary part of the software development process, as it helps customers and designers identify necessary system requirements. If these stakeho...
Daniela E. Herlea, Saul Greenberg
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 5 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
JPDC
2006
134views more  JPDC 2006»
13 years 9 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
COCOA
2009
Springer
14 years 3 months ago
Matching Techniques Ride to Rescue OLED Displays
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
Andreas Karrenbauer
MONET
2011
12 years 12 months ago
Distributed Coalition Formation Games for Secure Wireless Transmission
Cooperation among wireless nodes has been recently proposed for improving the physical layer (PHY) security of wireless transmission in the presence of multiple eavesdroppers. Whil...
Walid Saad, Zhu Han, Tamer Basar, Mérouane ...