5316 search results - page 219 / 1064 » Which Search Problems Are Random |
130
click to vote
CEC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract-- In many real-world scenarios, in contrast to standard benchmark optimization problems, we may face some uncertainties regarding the objective function. One source of the...
116
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...
146
Voted
WWW
2008
ACM
16 years 4 months ago
2008
ACM
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
115
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...
158
Voted
AIMSA
2008
Springer
15 years 6 months ago
2008
Springer
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...