2107 search results - page 209 / 422 » Computing Small Search Numbers in Linear Time |
127
click to vote
MCS
2006
Springer
15 years 3 months ago
2006
Springer
We investigate the amount of cooperation between agents in a population during reward collection that is required to minimize the overall collection time. In our computer simulati...
147
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Hidden Markov models (HMMs) have received considerable attention in various communities (e.g, speech recognition, neurology and bioinformatic) since many applications that use HMM...
144
click to vote
SAC
2005
ACM
15 years 9 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
138
click to vote
ISSAC
1997
Springer
15 years 8 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
103
click to vote
ICPP
2007
IEEE
15 years 10 months ago
2007
IEEE
A flooding-based search mechanism is often used in unstructured P2P systems. Although a flooding-based search mechanism is simple and easy to implement, it is vulnerable to overla...