1484 search results - page 98 / 297 » Ants meeting algorithms |
160
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
101
click to vote
ICNSC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Dynamic scheduling management in wireless sensor networks is one of the most challenging problems in long lifetime monitoring applications. In this paper, we propose and evalua...
ICMCS
2006
IEEE
15 years 4 months ago
2006
IEEE
In this paper, we present a speaker identification algorithm for a microphone array based on a first-order joint Hidden Markov Model (HMM) where the observations correspond to t...
CADE
1999
Springer
15 years 2 months ago
1999
Springer
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...