Sciweavers

1927 search results - page 282 / 386
» UMDAs for dynamic optimization problems
Sort
View
106
Voted
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
15 years 6 months ago
A genetic algorithm for unmanned aerial vehicle routing
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
Matthew A. Russell, Gary B. Lamont
ARC
2008
Springer
126views Hardware» more  ARC 2008»
15 years 2 months ago
DNA Physical Mapping on a Reconfigurable Platform
Reconfigurable architectures enable the hardware function to be implemented by the user and, due to its characteristics, have been used in many areas, including Bioinformatics. One...
Adriano Idalgo, Nahri Moreano
ATAL
2010
Springer
15 years 1 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...
141
Voted
JMLR
2010
149views more  JMLR 2010»
14 years 7 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
96
Voted
SECON
2008
IEEE
15 years 7 months ago
Predictive or Oblivious: A Comparative Study of Routing Strategies for Wireless Mesh Networks under Uncertain Demand
—Traffic routing plays a critical role in determining the performance of a wireless mesh network. To investigate the best solution, existing work proposes to formulate the mesh ...
Jonathan Wellons, Liang Dai, Yuan Xue, Yi Cui