1628 search results - page 157 / 326 » Partitioning Sets with Genetic Algorithms |
146
click to vote
ICCD
2004
IEEE
16 years 3 months 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...
205
click to vote
PODC
2004
ACM
15 years 11 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...
146
click to vote
COCOON
2008
Springer
15 years 7 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...
177
click to vote
SIAMCOMP
1998
15 years 5 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 ...
165
click to vote
CDC
2009
IEEE
15 years 3 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...