Sciweavers

1884 search results - page 118 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
PRL
2008
65views more  PRL 2008»
15 years 2 months ago
Matching of quasi-periodic time series patterns by exchange of block-sorting signatures
We propose a novel method for quasi-periodic time series patterns matching, through signature exchange between the two patterns. The signature is obtained through sorting of the t...
Bachir Boucheham
GLOBECOM
2006
IEEE
15 years 8 months ago
QoS-aware Object Replication in Overlay Networks
Abstract— Many emerging applications for peer to peer overlays may require nodes to satisfy strict timing deadlines to access a replica of a given object. This includes multimedi...
Won Jong Jeon, Indranil Gupta, Klara Nahrstedt
WEA
2010
Springer
545views Algorithms» more  WEA 2010»
15 years 9 months ago
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik...
ENTCS
2007
158views more  ENTCS 2007»
15 years 2 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
98
Voted
TIT
2010
82views Education» more  TIT 2010»
14 years 9 months ago
Average message delivery time for small-world networks in the continuum limit
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
Hazer Inaltekin, Mung Chiang, H. Vincent Poor