4110 search results - page 523 / 822 » Efficient algorithms for the 2-gathering problem |
136
click to vote
ASPDAC
2004
ACM
16 years 3 days ago
2004
ACM
- Data path connection elements, such as multiplexers, consume a significant amount of area on a VLSI chip, especially for FPGA designs. Multiplexer optimization is a difficult pro...
184
click to vote
ICIAP
1999
ACM
15 years 11 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
192
click to vote
ICNP
1997
IEEE
15 years 11 months ago
1997
IEEE
TCP's ability to share a bottleneck fairly and efficiently decreases as the number of competing flows increases. This effect starts to appear when there are more flows than p...
204
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
169
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
We study the joint allocation of three types of resources, namely, power, subcarriers and relay nodes, in cooperative two-hop multi-relay OFDM systems. Each relay adopts the amplif...