5316 search results - page 157 / 1064 » Which Search Problems Are Random |
135
Voted
CEC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization pr...
129
Voted
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
149
Voted
AI
2005
Springer
15 years 3 months ago
2005
Springer
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
142
Voted
TEC
2010
14 years 10 months ago
2010
Nurse rostering is a difficult search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle t...
138
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...