Sciweavers

4438 search results - page 734 / 888
» The Case for Collaborative Programming
Sort
View
PPDP
2005
Springer
15 years 10 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 10 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
15 years 10 months ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
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...
Leon Poladian
ECLIPSE
2004
ACM
15 years 10 months ago
JTutor: an Eclipse plug-in suite for creation and replay of code-based tutorials
Programming courses of all levels rely heavily on code examples. Often, to cover non-trivial subjects, it is convenient to present examples in the form of a tutorial. Such tutoria...
Chris Kojouharov, Aleksey Solodovnik, Gleb Naumovi...
ISSTA
2004
ACM
15 years 10 months ago
Automating commutativity analysis at the design level
Two operations commute if executing them serially in either order results in the same change of state. In a system in which commands may be issued simultaneously by different use...
Greg Dennis, Robert Seater, Derek Rayside, Daniel ...