486 search results - page 57 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
130
click to vote
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
The RTSJ memory model propose a mechanism based on a scope three containing all region-stacks in the system and a reference-counter collector. In order to avoid reference cycles a...
198
click to vote
ACRI
2004
Springer
15 years 10 months ago
2004
Springer
Cellular automata (CA) are highly parallel and discrete dynamical systems, whose behavior is completely specified in terms of a local relation. They were successfully applied for s...
145
click to vote
AAAI
2010
15 years 6 months ago
2010
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
136
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation...
189
click to vote
BMCBI
2010
15 years 4 days ago
2010
Background: The development, in the last decade, of stochastic heuristics implemented in robust application softwares has made large phylogeny inference a key step in most compara...