421 search results - page 36 / 85 » Exact and Heuristic Algorithms for the Weapon-Target Assignm... |
MP
2011
13 years 2 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
RTAS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical multiprocessor platform with dynamic voltage scaling...
INFORMATICALT
2006
13 years 7 months ago
2006
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...