511 search results - page 6 / 103 » Using Combinatorial Optimization Methods for Quantification ... |
CEC
2003
IEEE
15 years 2 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
101
click to vote
ICNC
2005
Springer
15 years 3 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
114
click to vote
IGARSS
2010
14 years 6 months ago
2010
Current uncertainties in the total solar irradiance (TSI) and aerosol radiative forcings of climate are so large that they limit quantitative evaluation of climate models against ...
AAAI
2010
14 years 11 months ago
2010
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
100
click to vote
PPSN
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...