3192 search results - page 588 / 639 » The minimum latency problem |
ICALP
1992
Springer
14 years 26 days ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
ASPDAC
2001
ACM
14 years 13 days ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
DIALM
2005
ACM
13 years 10 months ago
2005
ACM
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
NIPS
2007
13 years 10 months ago
2007
Automatic relevance determination (ARD) and the closely-related sparse Bayesian learning (SBL) framework are effective tools for pruning large numbers of irrelevant features leadi...
CIC
2004
13 years 10 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...