4037 search results - page 256 / 808 » Routing without ordering |
97
Voted
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
73
Voted
DAC
1995
ACM
15 years 4 months ago
1995
ACM
Abstract A central problem in embedded system co-synthesis is the generation of software for lowlevel I O. Scheduling still remains a manual task because existing coarse-grained re...
118
Voted
GRC
2008
IEEE
15 years 1 months ago
2008
IEEE
Deceptive problems have been considered difficult for ant colony optimization (ACO) and it was believed that ACO will fail to converge to global optima of deceptive problems. Thi...
76
Voted
ICPR
2010
IEEE
15 years 28 days ago
2010
IEEE
We present a new form of least squares (LS), called “hyperLS”, for geometric problems that frequently appear in computer vision applications. Doing rigorous error analysis, we...
109
Voted
CLUSTER
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—In addition to its use in local area networks, Ethernet has been used for connecting hosts in the area of highperformance computing. Here, we investigated the impact of ...