Sciweavers

990 search results - page 69 / 198
» Using evolution strategies to solve DEC-POMDP problems
Sort
View
EMMCVPR
2011
Springer
12 years 7 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
IUI
2005
ACM
14 years 1 months ago
Adaptive teaching strategy for online learning
Finding the optimal teaching strategy for an individual student is difficult even for an experienced teacher. Identifying and incorporating multiple optimal teaching strategies fo...
Jungsoon P. Yoo, Cen Li, Chrisila C. Pettey
ISHPC
1997
Springer
14 years 8 days ago
Implementing Iterative Solvers for Irregular Sparse Matrix Problems in High Performance Fortran
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
Eric de Sturler, Damian Loher
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 11 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
14 years 14 days ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin