Sciweavers

112 search results - page 13 / 23
» A Combinatorial Approach to Measuring Anonymity
Sort
View
CEC
2008
IEEE
14 years 1 months ago
Fitness functions for the unconstrained evolution of digital circuits
— This work is part of a project that aims to develop and operate integrated evolvable hardware systems using unconstrained evolution. Experiments are carried out on an evolvable...
Tüze Kuyucu, Martin Trefzer, Andrew J. Greens...
ICUMT
2009
13 years 5 months ago
A COP for cooperation in a P2P streaming protocol
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
María Elisa Bertinat, Darío Padula, ...
RECOMB
2008
Springer
14 years 7 months ago
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios
In the past years, many combinatorial arguments have been made to support the theory that mammalian genome rearrangement scenarios rely heavily on breakpoint reuse. Different model...
Anne Bergeron, Julia Mixtacki, Jens Stoye
KBSE
2005
IEEE
14 years 29 days ago
Constructing interaction test suites with greedy algorithms
Combinatorial approaches to testing are used in several fields, and have recently gained momentum in the field of software testing through software interaction testing. One-test...
Renée C. Bryce, Charles J. Colbourn
CONEXT
2005
ACM
13 years 9 months ago
Optimal positioning of active and passive monitoring devices
Network measurement is essential for assessing performance issues, identifying and locating problems. Two common strategies are the passive approach that attaches specific device...
Claude Chaudet, Eric Fleury, Isabelle Guéri...