2354 search results - page 288 / 471 » Assignment Problems |
173
click to vote
ICCAD
1993
IEEE
15 years 10 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...
196
click to vote
DIALM
2005
ACM
15 years 8 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...
161
Voted
JPDC
2006
15 years 6 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-...
173
click to vote
SIGECOM
2008
ACM
15 years 6 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...
197
click to vote
ATMOS
2010
15 years 5 months ago
2010
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...