Sciweavers

2108 search results - page 98 / 422
» Constrained Heuristic Search
Sort
View
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
15 years 5 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
AAAI
2006
15 years 3 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
EDBT
2008
ACM
111views Database» more  EDBT 2008»
16 years 1 months ago
Micro-aggregation-based heuristics for p-sensitive k-anonymity: one step beyond
Micro-data protection is a hot topic in the field of Statistical Disclosure Control (SDC), that has gained special interest after the disclosure of 658000 queries by the AOL searc...
Agusti Solanas, Francesc Sebé, Josep Doming...
SPIN
2007
Springer
15 years 7 months ago
Generating Counter-Examples Through Randomized Guided Search
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
Neha Rungta, Eric G. Mercer
HEURISTICS
2002
65views more  HEURISTICS 2002»
15 years 1 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...