1984 search results - page 168 / 397 » The colourful feasibility problem |
161
click to vote
CN
1998
15 years 6 months ago
1998
The World Wide Web currently has a huge amount of data, with practically no classification information, and this makes it extremely difficult to handle effectively. It has been re...
156
click to vote
CP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Branch-and-Check, introduced ten years ago, is a generalization of logic-based Benders decomposition. The key extension is to solve the Benders sub-problems at each feasi...
152
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper considers weighted sum rate maximization of multiuser multiple-input single-output interference channel (MISO-IFC) under outage constraints. The outage-constrained weig...
187
click to vote
CGF
2006
15 years 6 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
170
click to vote
TON
2008
15 years 6 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...