Sciweavers

2300 search results - page 168 / 460
» Maximally Concurrent Programs
Sort
View
130
Voted
COR
2002
90views more  COR 2002»
15 years 2 months ago
Extremist vs. centrist decision behavior: quasi-convex utility functions for interactive multi-objective linear programming prob
This paper presents the fundamental theory and algorithms for identifying the most preferred alternative for a decision maker (DM) having a non-centrist (or extremist) preferentia...
Behnam Malakooti, Jumah E. Al-alwani
156
Voted
WIOPT
2010
IEEE
15 years 15 days ago
Optimizing power allocation in interference channels using D.C. programming
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
Hussein Al-Shatri, Tobias Weber
100
Voted
PLDI
2009
ACM
15 years 9 months ago
Programming model for a heterogeneous x86 platform
The client computing platform is moving towards a heterogeneous architecture consisting of a combination of cores focused on scalar performance, and a set of throughput-oriented c...
Bratin Saha, Xiaocheng Zhou, Hu Chen, Ying Gao, Sh...
127
Voted
FCT
2007
Springer
15 years 6 months ago
Product Rules in Semidefinite Programming
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
Rajat Mittal, Mario Szegedy
105
Voted
ICMLA
2007
15 years 4 months ago
Maximum Likelihood Quantization of Genomic Features Using Dynamic Programming
Dynamic programming is introduced to quantize a continuous random variable into a discrete random variable. Quantization is often useful before statistical analysis or reconstruct...
Mingzhou (Joe) Song, Robert M. Haralick, Sté...