Sciweavers

344 search results - page 34 / 69
» The Directed Minimum Latency Problem
Sort
View
129
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
ASPDAC
2006
ACM
98views Hardware» more  ASPDAC 2006»
15 years 8 months ago
Timing-driven placement based on monotone cell ordering constraints
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
Chanseok Hwang, Massoud Pedram
128
Voted
IJAIT
2008
99views more  IJAIT 2008»
15 years 2 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
112
Voted
COCOA
2009
Springer
15 years 7 months ago
Variable-Size Rectangle Covering
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang
COMPCON
1995
IEEE
15 years 6 months ago
IEEE 1394: A Ubiquitous Bus
A link is an unreliable FIFO channel. As we mentioned earlier, it is an abstraction of a point-topoint wire or of a simple broadcast LAN. It is unreliable because noise or other ph...
Gary Hoffman, Daniel Moore