16091 search results - page 3118 / 3219 » Solving |
TCAD
2008
13 years 10 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
TCOM
2008
2008
Relay assisted F/TDMA ad hoc networks: node classification, power allocation and relaying strategies
13 years 10 months ago
This paper considers the design of relay assisted F/TDMA ad hoc networks with multiple relay nodes each of which assists the transmission of a predefined subset of source nodes to ...
TCOM
2008
13 years 10 months ago
2008
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
TCOM
2008
13 years 10 months ago
2008
We consider the problem of differentiated rate scheduling for the downlink (i.e., multi-antenna broadcast channel), in the sense that the rates required by different users must sat...
TCS
2008
13 years 10 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...