Sciweavers

2479 search results - page 71 / 496
» Random Event Structures
Sort
View
SRDS
2000
IEEE
14 years 1 months ago
Detection of Livelocks in Communication Protocols by Means of a Polygon Time Structure
As has been shown, the polygon time structure overcomes the main limitations of the interval time structure, and allows to verify communication protocols, in which the explicit co...
Jerzy Brzezinski, Michal Sajkowski
AMAST
1991
Springer
14 years 11 days ago
Event Spaces and their Linear Logic
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
Vaughan R. Pratt
KDD
2012
ACM
244views Data Mining» more  KDD 2012»
11 years 11 months ago
Open domain event extraction from twitter
Tweets are the most up-to-date and inclusive stream of information and commentary on current events, but they are also fragmented and noisy, motivating the need for systems that c...
Alan Ritter, Mausam, Oren Etzioni, Sam Clark
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
14 years 2 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
ISCIS
2005
Springer
14 years 2 months ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy