4797 search results - page 204 / 960 » The complexity of partition tasks |
161
click to vote
IPPS
2008
IEEE
16 years 26 days ago
2008
IEEE
An architectural framework is studied that can perform dynamic reconfiguration. A basic objective is to dynamically reconfigure the architecture so that its configuration is well ...
153
click to vote
FSTTCS
2007
Springer
16 years 18 days ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
187
click to vote
ICTAI
2005
IEEE
16 years 1 days ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
171
click to vote
COMAD
2008
15 years 8 months ago
2008
We propose an efficient sampling based outlier detection method for large high-dimensional data. Our method consists of two phases. In the first phase, we combine a "sampling...
154
click to vote
TON
1998
15 years 6 months ago
1998
— This paper investigates in detail the blocking and nonblocking behavior of multirate Clos switching networks at the connection/virtual connection level. The results are applica...