3134 search results - page 171 / 627 » Computing full disjunctions |
200
click to vote
INFOCOM
2005
IEEE
16 years 13 days ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
162
click to vote
IPPS
2005
IEEE
16 years 13 days ago
2005
IEEE
The problem of scheduling independent tasks on heterogeneous trees is considered. The nodes of the tree may have different processing times, and links different communication time...
182
click to vote
ISPAN
2005
IEEE
16 years 13 days ago
2005
IEEE
Most high-end switches use an input-queued or a combined input- and output-queued architecture. The switch fabrics of these architectures commonly use an iterative scheduling syst...
167
click to vote
EDCC
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. Current paper proposes an efficient alternative for traditional gatelevel fault simulation. The authors explain how Structurally Synthesized Binary Decision Diagrams (SSB...
165
click to vote
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...