Sciweavers

1617 search results - page 10 / 324
» Constraints in Weighted Averaging
Sort
View
TIT
2008
65views more  TIT 2008»
15 years 16 days ago
Power-Efficient Resource Allocation for Time-Division Multiple Access Over Fading Channels
We investigate resource allocation policies for time-division multiple access (TDMA) over fading channels in the power-limited regime. For frequency-flat block-fading channels and ...
Xin Wang, Georgios B. Giannakis
FLAIRS
2003
15 years 2 months ago
Soft CLP (FD)
Over-constrained problems can be solved with the help of soft constraints. Weighted constraints are a typical representation of soft constraints used to minimize weights of unsati...
Hana Rudová
87
Voted
CONSTRAINTS
2010
75views more  CONSTRAINTS 2010»
14 years 10 months ago
Redundant modeling in permutation weighted constraint satisfaction problems
Yat Chiu Law, Jimmy Ho-Man Lee, May H. C. Woo
106
Voted
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
15 years 7 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku