Sciweavers

654 search results - page 101 / 131
» Ordered Sets and Complete Lattices
Sort
View
TSE
1998
112views more  TSE 1998»
13 years 7 months ago
Message Logging: Pessimistic, Optimistic, Causal, and Optimal
Message-logging protocols are an integral part of a popular technique for implementing processes that can recover from crash failures. All message-logging protocols require that, ...
Lorenzo Alvisi, Keith Marzullo
TEC
2002
183views more  TEC 2002»
13 years 7 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
ISVD
2010
IEEE
13 years 6 months ago
Alpha Shape Topology of the Cosmic Web
—We study the topology of the Megaparsec Cosmic Web on the basis of the Alpha Shapes of the galaxy distribution. The simplicial complexes of the alpha shapes are used to determin...
Rien van de Weygaert, Erwin Platen, Gert Vegter, B...
NAACL
2010
13 years 5 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
FUIN
2010
141views more  FUIN 2010»
13 years 5 months ago
Decidability Problems in Petri Nets with Names and Replication
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T n...
Fernando Rosa Velardo, David de Frutos-Escrig