Sciweavers

6409 search results - page 368 / 1282
» A Computational Algorithm for Origami Design
Sort
View
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
16 years 7 days ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
ICCS
2003
Springer
15 years 12 months ago
An Efficient Collective Communication Method for Grid Scale Networks
Abstract. This research is to design a collection of effective collective operations for the Grid scale network environment. In the Grid, several network features should be specifi...
Kyung-Lang Park, Hwang-Jik Lee, Youn-Joo Lee, Oh-Y...
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
15 years 10 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
DAC
2005
ACM
16 years 7 months ago
FPGA technology mapping: a study of optimality
This paper attempts to quantify the optimality of FPGA technology mapping algorithms. We develop an algorithm, based on Boolean satisfiability (SAT), that is able to map a small s...
Andrew C. Ling, Deshanand P. Singh, Stephen Dean B...
DAC
2005
ACM
16 years 7 months ago
Multi-threaded reachability
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer,...