4860 search results - page 285 / 972 » SNPs Problems, Complexity, and Algorithms |
96
Voted
VLDB
1997
ACM
15 years 4 months ago
1997
ACM
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
112
Voted
EC
2010
15 years 24 days ago
2010
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
151
Voted
MOBIHOC
2004
ACM
16 years 9 days ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
101
Voted
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
101
Voted
TC
2008
15 years 19 days ago
2008
On-chip networks (OCNs) have been proposed to solve the increasing scale and complexity of the designs in nanoscale multicore VLSI designs. The concept of irregular meshes is an im...