Sciweavers

7921 search results - page 1333 / 1585
» LSH-preserving functions and their applications
Sort
View
IJNVO
2011
47views more  IJNVO 2011»
15 years 1 months ago
Harvesting covert networks: a case study of the iMiner database
: Data collection of covert networks is an inherently difficult task because of the very nature of these networks. Researchers find it difficult to locate and access data relating ...
Nasrullah Memon, Uffe Kock Wiil, Reda Alhajj, Clau...
IJRR
2011
126views more  IJRR 2011»
15 years 1 months ago
Optimization and learning for rough terrain legged locomotion
We present a novel approach to legged locomotion over rough terrain that is thoroughly rooted in optimization. This approach relies on a hierarchy of fast, anytime algorithms to p...
Matthew Zucker, Nathan D. Ratliff, Martin Stolle, ...
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 1 months ago
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
Yi Gai, Bhaskar Krishnamachari, Rahul Jain
252
Voted
PCS
2011
15 years 1 months ago
The parametric solution of underdetermined linear ODEs
The purpose of this paper is twofold. An immediate practical use of the presented algorithm is its applicability to the parametric solution of underdetermined linear ordinary diļ¬...
Thomas Wolf
SIAMJO
2011
15 years 1 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu
« Prev « First page 1333 / 1585 Last » Next »