4229 search results - page 151 / 846 » On the Optimality of Spiral Search |
118
click to vote
SOCO
2010
Springer
2010
Springer
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
14 years 11 months ago
Local genetic algorithms have been designed with the aim of providing effective intensification. One of their most outstanding features is that they may help classical local searc...
128
click to vote
TSMC
2011
14 years 8 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
110
click to vote
AAAI
2010
15 years 2 months ago
2010
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
DEXAW
2010
IEEE
15 years 2 months ago
2010
IEEE
Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects userdefined bounds on the number of returned hits. We assume a real-world...
111
click to vote
ASPDAC
2004
ACM
15 years 6 months ago
2004
ACM
This paper describes a sub-mW motion estimation processor core for MPEG-4 video encoding. It features a Gradient Descent Search algorithm whose computation power is only 7% of the...