Sciweavers

486 search results - page 57 / 98
» Parallel Algorithms for Relational Coarsest Partition Proble...
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
Towards an analysis of race carrier conditions in real-time Java
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...
M. Teresa Higuera-Toledano
ACRI
2004
Springer
14 years 1 months ago
Block Encryption Using Reversible Cellular Automata
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...
Marcin Seredynski, Pascal Bouvry
AAAI
2010
13 years 9 months ago
Symbolic Dynamic Programming for First-order POMDPs
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...
Scott Sanner, Kristian Kersting
KDD
2006
ACM
112views Data Mining» more  KDD 2006»
14 years 8 months ago
K-means clustering versus validation measures: a data distribution perspective
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...
Hui Xiong, Junjie Wu, Jian Chen
BMCBI
2010
185views more  BMCBI 2010»
13 years 2 months ago
MetaPIGA v2.0: maximum likelihood large phylogeny estimation using the metapopulation genetic algorithm and other stochastic heu
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...
Raphaël Helaers, Michel C. Milinkovitch