Sciweavers

1541 search results - page 234 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
SIGECOM
2009
ACM
132views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Limited and online supply and the bayesian foundations of prior-free mechanism design
We study auctions for selling a limited supply of a single commodity in the case where the supply is known in advance and the case it is unknown and must be instead allocated in a...
Nikhil R. Devanur, Jason D. Hartline
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
14 years 1 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
IJCNN
2000
IEEE
14 years 15 days ago
Metrics that Learn Relevance
We introduce an algorithm for learning a local metric to a continuous input space that measures distances in terms of relevance to the processing task. The relevance is defined a...
Samuel Kaski, Janne Sinkkonen
ALDT
2009
Springer
126views Algorithms» more  ALDT 2009»
14 years 4 days ago
On Low-Envy Truthful Allocations
We study the problem of allocating a set of indivisible items to players having additive utility functions over the items. We consider allocations in which no player envies the bun...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
EOR
2008
200views more  EOR 2008»
13 years 8 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...