Sciweavers

1177 search results - page 122 / 236
» System-in-Package Testing: Problems and Solutions
Sort
View
EVOW
2007
Springer
15 years 4 months ago
Generation of Tree Decompositions by Iterated Local Search
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Nysret Musliu
INFOCOM
1997
IEEE
15 years 2 months ago
Restoration Strategies and Spare Capacity Requirements in Self-Healing ATM Networks
—This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The ...
Yijun Xiong, Lorne Mason
CPE
1994
Springer
170views Hardware» more  CPE 1994»
15 years 2 months ago
Automatic Scalability Analysis of Parallel Programs Based on Modeling Techniques
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
CEC
2007
IEEE
15 years 1 months ago
Virtual reality high dimensional objective spaces for multi-objective optimization: An improved representation
This paper presents an approach for constructing improved visual representations of high dimensional objective spaces using virtual reality. These spaces arise from the solution of...
Julio J. Valdés, Alan J. Barton, Robert Orc...
AIPS
2010
15 years 7 days ago
Cost-Optimal Factored Planning: Promises and Pitfalls
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...