989 search results - page 128 / 198 » Approximating the Pareto optimal set using a reduced set of ... |
AIPS
2007
13 years 10 months ago
2007
Many scheduling problems reside in uncertain and dynamic environments – tasks have a nonzero probability of failure and may need to be rescheduled. In these cases, an optimized ...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
In this paper, we study the problem of finding optimal mappings for several independent but concurrent workflow applications, in order to optimize performance-related criteria tog...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
14 years 7 days ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
GLOBECOM
2010
IEEE
13 years 6 months ago
2010
IEEE
This paper addresses the issue of network life during repeated broadcasts originating from the same source in large, strip-shaped wireless sensor networks. The proposed technique w...