Sciweavers

9119 search results - page 190 / 1824
» A Simultaneous Search Problem
Sort
View
167
Voted
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 6 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar
AAMAS
2005
Springer
15 years 6 months ago
Cooperative Multi-Agent Learning: The State of the Art
Cooperative multi-agent systems are ones in which several agents attempt, through their interaction, to jointly solve tasks or to maximize utility. Due to the interactions among t...
Liviu Panait, Sean Luke
OPODIS
2008
15 years 8 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
ISMVL
1996
IEEE
76views Hardware» more  ISMVL 1996»
15 years 10 months ago
A Multiple-Valued Ferroelectric Content-Addressable Memory
A novel architecturefor a Multiple-Valued Ferroelectric Content-Addressable Memory (FCAM) is proposed. An FCAM employs ferroelectric capacitors as storage elements to provide a no...
Ali Sheikholeslami, P. Glenn Gulak, Takahiro Hanyu
DAM
2008
115views more  DAM 2008»
15 years 6 months ago
Variable space search for graph coloring
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey