511 search results - page 46 / 103 » Using Combinatorial Optimization Methods for Quantification ... |
AIPS
2006
14 years 11 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Hyper-heuristics or “heuristics that coordinate heuristics” are fastly becoming popular for solving combinatorial optimisation problems. These methods do not search directl...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—A significant fraction of network events (such as topology or route changes) and the resulting performance degradation stem from premeditated network management and operational...
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract - This paper describes an efficient graphbased method to optimize data-flow expressions for best hardware implementation. The method is based on factorization, common su...
ISHPC
2003
Springer
15 years 2 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...