6409 search results - page 699 / 1282 » A Computational Algorithm for Origami Design |
173
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
169
Voted
GECCO
2009
Springer
16 years 29 days ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
143
click to vote
IMC
2007
ACM
15 years 8 months ago
2007
ACM
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
233
click to vote
RECOMB
2001
Springer
16 years 6 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
177
click to vote
PG
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. We define an effectiveness measure for a ...