4451 search results - page 241 / 891 » On Random Ordering Constraints |
154
Voted
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Interval coefficients have been introduced in OR and CP to specify uncertain data in order to provide reliable solutions to convex models. The output is generally a solution set, ...
192
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
165
click to vote
CP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
160
click to vote
PLDI
1996
ACM
15 years 10 months ago
1996
ACM
High performance compilers increasingly rely on accurate modeling of the machine resources to efficiently exploit the instruction level parallelism of an application. In this pape...
170
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract--Current multibeam satellite systems perform centralized power and carrier allocation assuming a Multi-Frequency Time Division Multiple Access (MF-TDMA) scheme with fixed ...