1809 search results - page 78 / 362 » Weakly Computable Real Numbers |
148
click to vote
RECOMB
2010
Springer
15 years 2 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
130
click to vote
CIBCB
2005
IEEE
15 years 9 months ago
2005
IEEE
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
150
click to vote
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
115
Voted
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
— System-on-Chip designs often have a large number of timing domains. Communication between these domains requires synchronization, and the failure probabilities of these synchro...
137
Voted
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. The Real-Time Calculus (RTC) [16] is a framework to analyze heterogeneous real-time systems that process event streams of data. The streams are characterized by pairs of ...