986 search results - page 16 / 198 » Generalized Goal Programming: polynomial methods and applica... |
IPPS
2000
IEEE
14 years 4 days ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
AIPS
2011
12 years 11 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
IEEEPACT
1998
IEEE
14 years 2 hour ago
1998
IEEE
Method speculation of object-oriented programs attempts to exploit method-level parallelism (MLP) by executing sequential method invocations in parallel, while still maintaining c...
ISSAC
1995
Springer
13 years 11 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...