1628 search results - page 157 / 326 » Partitioning Sets with Genetic Algorithms |
120
Voted
ICCD
2004
IEEE
16 years 18 days ago
2004
IEEE
In this work, we propose a dynamic power-aware issue queue in a general-purpose microprocessor for multimedia applications. Its resources can be adapted at runtime in accordance w...
169
Voted
PODC
2004
ACM
15 years 9 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
116
Voted
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
147
Voted
SIAMCOMP
1998
15 years 3 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
131
Voted
CDC
2009
IEEE
15 years 1 months ago
2009
IEEE
We consider the problem of controlling a continuous-time linear stochastic system from a specification given as a Linear Temporal Logic (LTL) formula over a set of linear predicate...