1650 search results - page 254 / 330 » The HOM problem is decidable |
123
click to vote
ISPD
2003
ACM
15 years 9 months ago
2003
ACM
— In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis syste...
143
click to vote
DATE
2010
IEEE
15 years 9 months ago
2010
IEEE
—With every process generation, the problem of variability in physical parameters and environmental conditions poses a great challenge to the design of fast and reliable circuits...
165
click to vote
ICDCS
2002
IEEE
15 years 9 months ago
2002
IEEE
In the real-time environments, information is disseminated to clients with timing constraint. In this paper, we focus on the real time data scheduling problem in multiple broadcas...
129
click to vote
LCN
2002
IEEE
15 years 9 months ago
2002
IEEE
—The design of a wireless local area network (WLAN) has an important issue of determining the optimal placement of access points (APs) and assignment of channels to them. WLAN se...
135
click to vote
SIGECOM
2010
ACM
15 years 9 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...