4759 search results - page 346 / 952 » Parallelizing the Phylogeny Problem |
178
click to vote
CONCUR
2003
Springer
15 years 12 months ago
2003
Springer
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
135
click to vote
VMV
2008
15 years 8 months ago
2008
Recently it was observed, that a combined formulation of tracking and reconstruction increases the robustness and accuracy of both these steps in structure-from-motion problems [9...
187
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
- Parallel robots admit generally several solutions to the direct kinematics problem. The aspects are associated with the maximal singularity free domains without any singular conf...
150
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
199
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...