Sciweavers

2027 search results - page 23 / 406
» When is it best to best-respond
Sort
View
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
14 years 4 months ago
A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
Sung Eun Bae, Tadao Takaoka
DEXAW
2006
IEEE
132views Database» more  DEXAW 2006»
14 years 4 months ago
Tokens for Anonymous Communications in the Internet
With the growth and acceptance of the Internet, there has been increased interest in maintaining anonymity in the network. Using traffic analysis, it is possible to infer who is t...
Arjan Durresi, Vamsi Paruchuri, Leonard Barolli, R...
IROS
2006
IEEE
118views Robotics» more  IROS 2006»
14 years 4 months ago
Optimal Direction of Grasped Object Minimizing Contact Forces
Abstract— When grasping an object, friction forces are sometimes utilized. Because of this friction forces, the object is manipulable to various direction. In this paper, we disc...
Satoshi Ito, Yuuki Mizukoshi, Koji Ishihara, Minor...
COLT
2006
Springer
14 years 1 months ago
Continuous Experts and the Binning Algorithm
Abstract. We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolut...
Jacob Abernethy, John Langford, Manfred K. Warmuth
EOR
2006
62views more  EOR 2006»
13 years 10 months ago
A sequential procedure for neighborhood selection-of-the-best in optimization via simulation
We propose a fully sequential indifference-zone selection procedure that is specifically for use within an optimization-via-simulation algorithm when simulation is costly, and par...
Juta Pichitlamken, Barry L. Nelson, L. Jeff Hong