Sciweavers

1871 search results - page 36 / 375
» The Ephemeral Pairing Problem
Sort
View
ICASSP
2010
IEEE
14 years 9 months ago
Disambiguation in multidimensional tracking of multiple acoustic sources using a Gaussian likelihood criterion
The TDOA-based acoustic source localization approaches suffer from a pairing problem in the case of multiple dimensions and multiple sources. To resolve this problem, usually thre...
Pengxiao Teng, Anthony Lombard, Walter Kellermann
COCO
2003
Springer
135views Algorithms» more  COCO 2003»
15 years 4 months ago
Disjoint NP-Pairs
We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof system...
Christian Glaßer, Alan L. Selman, Samik Seng...
HIS
2004
15 years 15 days ago
Stigmergy in Multi Agent Reinforcement Learning
In this paper, we describe how certain aspects of the biological phenomena of stigmergy can be imported into multiagent reinforcement learning (MARL), with the purpose of better e...
Raghav Aras, Alain Dutech, François Charpil...
SWAT
2004
Springer
171views Algorithms» more  SWAT 2004»
15 years 4 months ago
Connectivity of Graphs Under Edge Flips
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
Norbert Zeh
ACNS
2008
Springer
94views Cryptology» more  ACNS 2008»
15 years 1 months ago
An Authentication Scheme Based on the Twisted Conjugacy Problem
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. The alleged computational hardness of this problem in some groups was...
Vladimir Shpilrain, Alexander Ushakov