Sciweavers

688 search results - page 29 / 138
» The Flow Set with Partial Order
Sort
View
ORDER
2006
154views more  ORDER 2006»
13 years 7 months ago
A Bipartite Analogue of Dilworth's Theorem
Let r be a fixed positive integer. It is shown that, given any partial orders >1, . . ., >r on the same n-element set P, there exist disjoint subsets A, B P, each with at l...
Jacob Fox
ICTAI
2005
IEEE
14 years 29 days ago
Subgoal Ordering and Granularity Control for Incremental Planning
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...
Chih-Wei Hsu, Yixin Chen
DFT
2006
IEEE
105views VLSI» more  DFT 2006»
14 years 1 months ago
Thermal-Aware SoC Test Scheduling with Test Set Partitioning and Interleaving
1 High temperature has become a major problem for system-on-chip testing. In order to reduce the test time while keeping the temperature of the chip under test within a safe range,...
Zhiyuan He, Zebo Peng, Petru Eles, Paul M. Rosinge...
AIPS
2007
13 years 9 months ago
A Fast Incremental Algorithm for Maintaining Dispatchability of Partially Controllable Plans
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...
Julie A. Shah, John Stedl, Brian C. Williams, Paul...
GLOBECOM
2009
IEEE
13 years 11 months ago
Multi-Commodity Flow Traffic Engineering with Hybrid MPLS/OSPF Routing
A common objective of Internet traffic engineering is to minimize the maximal link utilization in a network in order to accommodate more traffic and reduce the chance of congestion...
Mingui Zhang, Bin Liu, Beichuan Zhang