3367 search results - page 461 / 674 » Incremental assignment problem |
143
Voted
ICCAD
1993
IEEE
15 years 8 months ago
1993
IEEE
We have proposed an e cient measure to reduce the clock skew by assigning the clock network with variable branch widths. This measure has long been used for \H" clock tree. T...
141
click to vote
COLT
1993
Springer
15 years 8 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
159
Voted
DIALM
2005
ACM
15 years 6 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...
133
click to vote
JPDC
2006
15 years 4 months ago
2006
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
140
Voted
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...