261 search results - page 25 / 53 » On Threshold BDDs and the Optimal Variable Ordering Problem |
AIPS
2006
13 years 9 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...
CDC
2009
IEEE
14 years 13 days ago
2009
IEEE
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
JUCS
2008
13 years 7 months ago
2008
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
COR
2010
13 years 7 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Much research has been devoted to maximize the life time of mobile ad-hoc networks. Life time has often been defined as the time elapsed until the first node is out of battery...