6149 search results - page 1067 / 1230 » Revealing the programming process |
169
click to vote
RTA
2005
Springer
15 years 10 months ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
170
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
175
Voted
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
122
Voted
SIGUCCS
2004
ACM
15 years 10 months ago
2004
ACM
In June 2003, Lehigh University embarked on an experiment to present incoming freshmen with an online pre-orientation experience using the SCT Luminis 3 Portal environment. Three ...
138
click to vote
WOSP
2004
ACM
15 years 10 months ago
2004
ACM
Modelling and analysing distributed and mobile software systems is a challenging task. PEPA nets—coloured stochastic Petri nets—are a recently introduced modelling formalism w...