Sciweavers

8431 search results - page 134 / 1687
» Algorithmically Independent Sequences
Sort
View
AAMAS
2005
Springer
15 years 3 months ago
Learning to Coordinate Using Commitment Sequences in Cooperative Multi-agent Systems
We report on an investigation of the learning of coordination in cooperative multi-agent systems. Specifically, we study solutions that are applicable to independent agents i.e. ...
Spiros Kapetanakis, Daniel Kudenko, Malcolm J. A. ...
ICIP
2001
IEEE
15 years 11 months ago
Robust estimation of depth and motion using stochastic approximation
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...
Rama Chellappa, Amit K. Roy Chowdhury
NIPS
2007
14 years 11 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 2 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
GECCO
2006
Springer
171views Optimization» more  GECCO 2006»
15 years 1 months ago
A hybrid genetic search for multiple sequence alignment
This paper proposes a hybrid genetic algorithm for multiple sequence alignment. The algorithm evolves guide sequences and aligns input sequences based on the guide sequences. It a...
Seung-Hyun Moon, Sung-Soon Choi, Byung Ro Moon