Sciweavers

3238 search results - page 350 / 648
» Multi-return function call
Sort
View
JUCS
2002
90views more  JUCS 2002»
15 years 6 months ago
How Large is the Set of Disjunctive Sequences?
: We consider disjunctive sequences, that is, infinite sequences (-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described...
Ludwig Staiger
LISP
2002
135views more  LISP 2002»
15 years 6 months ago
Optimizing Nested Loops Using Local CPS Conversion
Abstract. Local CPS conversion is a compiler transformation for improving the code generated for nested loops by a direct-style compiler that uses recursive functions to represent ...
John H. Reppy
MICRO
2002
IEEE
131views Hardware» more  MICRO 2002»
15 years 6 months ago
Protocol Wrappers for Layered Network Packet Processing in Reconfigurable Hardware
abstracting the operation of lower-level packet processing functions. The library synthesizes into field-programmable gate array (FPGA) logic and is utilized in a network platform ...
Florian Braun, John W. Lockwood, Marcel Waldvogel
MST
2002
152views more  MST 2002»
15 years 6 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
TCAD
1998
91views more  TCAD 1998»
15 years 6 months ago
Cost-free scan: a low-overhead scan path design
Conventional scan design imposes considerable area and delay overhead by using larger scan ip- ops and additional scan wires without utilizing the functionality of the combinatio...
Chih-Chang Lin, Malgorzata Marek-Sadowska, Mike Ti...