Sciweavers

1763 search results - page 6 / 353
» Dependent random choice
Sort
View
CORR
2010
Springer
132views Education» more  CORR 2010»
13 years 9 months ago
Small NFAs from Regular Expressions: Some Experimental Results
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
Hugo Gouveia, Nelma Moreira, Rogério Reis
QEST
2009
IEEE
14 years 3 months ago
On the Impact of Modelling Choices for Distributed Information Spread
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
Rena Bakhshi, Ansgar Fehnker
EURODAC
1995
IEEE
112views VHDL» more  EURODAC 1995»
14 years 15 days ago
On implementation choices for iterative improvement partitioning algorithms
Iterative improvement partitioning algorithms such as the FM algorithm of Fiduccia and Mattheyses 8 , the algorithm of Krishnamurthy 13 , and Sanchis's extensions of these al...
Lars W. Hagen, Dennis J.-H. Huang, Andrew B. Kahng
IPPS
2000
IEEE
14 years 1 months ago
Transient Analysis of Dependability/Performability Models by Regenerative Randomization with Laplace Transform Inversion
In this paper we develop a variant of a previously proposed method the regenerative randomization method for the transient analysis of dependability performability models. The va...
Juan A. Carrasco
JAL
2008
97views more  JAL 2008»
13 years 9 months ago
Experimental studies of variable selection strategies based on constraint weights
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
Richard J. Wallace, Diarmuid Grimes