Back to Results
First PageMeta Content
NP-complete problems / Clique / Network coding / Shortest path problem / Maximal independent set / Path decomposition / Graph theory / Theoretical computer science / Mathematics


This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2011 proceedings Completion Delay Minimization for Instantly Decodable Networ
Add to Reading List

Document Date: 2011-12-23 16:23:54

Open Document

File Size: 144,30 KB

Share Result on Facebook

Company

IEEE Global Telecommunications / Vertex / /

Currency

USD / /

/

Facility

Computer Engineering University of Toronto Toronto / /

IndustryTerm

wireless sender / Wireless Communations / search clique selection algorithms / streaming communications / decodable network / cellular networks / maximum weight clique selection algorithm / search heuristic / satellite imaging / large network / maximum weight clique search algorithms / wireless coding networks / real-time applications / value iteration algorithms / large networks / selection algorithms / maximum weight clique search / feedback algorithm / feedback algorithms / search algorithm / adaptive network / /

Organization

Department of Electrical / International Criminal Court / Electrical and Computer Engineering University of Toronto Toronto / IEEE Communications Society / /

Person

B. Full / Sameh Sorour / Shahrokh Valaee / /

ProvinceOrState

North Carolina / Ontario / /

Technology

modified algorithms / maximum weight clique selection algorithm / search clique selection algorithms / value iteration algorithms / IDNC selection algorithms / search algorithm / feedback algorithms / feedback algorithm / FVEsrh algorithms / designed algorithms / IDNC algorithms / Simulation / maximum weight clique search algorithms / same algorithm / four algorithms / /

SocialTag