2272 search results - page 109 / 455 » Capture Complexity by Partition |
100
click to vote
ICTAI
2005
IEEE
15 years 3 months 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...
COMAD
2008
14 years 11 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...
TON
1998
14 years 9 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...
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper focuses on parallelization of the classic static timing analysis (STA) algorithm for verifying timing characteristics of digital integrated circuits. Given ever-increasi...
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...