550 search results - page 8 / 110 » Optimization and Approximation Problems Related to Polynomia... |
JAIR
2006
13 years 7 months ago
2006
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
EUROCAST
2005
Springer
14 years 1 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...