14078 search results - page 371 / 2816 » Design and Analysis of Computer Algorithms |
153
click to vote
ESORICS
2004
Springer
16 years 5 days ago
2004
Springer
We evaluate the anonymity provided by two popular email mix implementations, Mixmaster and Reliable, and compare their effectiveness through the use of simulations which model th...
191
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
168
click to vote
GPEM
2007
15 years 6 months ago
2007
We present a novel means of algorithmically describing a growth process that is an extension of Lindenmayer’s Map L-systems. This growth process relies upon a set of rewrite rule...
146
click to vote
CHI
2004
ACM
16 years 7 months ago
2004
ACM
Minimizing interruptions to users is a crucial and acknowledged precondition for the adoption of new intelligent technologies such as ubiquitous and proactive computing. This pape...
187
click to vote
JCST
2010
15 years 1 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...