Sciweavers

187 search results - page 30 / 38
» Optimal strategies in sequential bidding
Sort
View
GBRPR
2007
Springer
15 years 3 months ago
Approximating TSP Solution by MST Based Graph Pyramid
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo,...
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 9 months ago
One shot schemes for decentralized quickest change detection
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment....
Olympia Hadjiliadis, Hongzhong Zhang, H. Vincent P...
86
Voted
HM
2005
Springer
97views Optimization» more  HM 2005»
15 years 3 months ago
Comparing Parallelization of an ACO: Message Passing vs. Shared Memory
We present a shared memory approach to the parallelization of the Ant Colony Optimization (ACO) metaheuristic and a performance comparison with an existing message passing implemen...
Pierre Delisle, Marc Gravel, Michaël Krajecki...
SCIA
2005
Springer
211views Image Analysis» more  SCIA 2005»
15 years 3 months ago
Perception-Action Based Object Detection from Local Descriptor Combination and Reinforcement Learning
This work proposes to learn visual encodings of attention patterns that enables sequential attention for object detection in real world environments. The system embeds a saccadic d...
Lucas Paletta, Gerald Fritz, Christin Seifert
63
Voted
PODC
1998
ACM
15 years 1 months ago
Amortizing Randomness in Private Multiparty Computations
We study the relationship between the number of rounds needed to repeatedly perform a private computation i.e., where there are many sets of inputs sequentially given to the play...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...