19700 search results - page 206 / 3940 » DNA-Based Computation Times |
133
click to vote
FCCM
1998
IEEE
15 years 9 months ago
1998
IEEE
Custom Computing Machines (CCM's) have demonstrated significant performance advantages over general-purpose processors for certain classes of problems. However, problems can ...
133
click to vote
SEMWEB
2009
Springer
15 years 12 months ago
2009
Springer
Given two classifications, or lightweight ontologies, we compute the minimal mapping, namely the subset of all possible correspondences, called mapping elements, between them such ...
158
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
We have developed an instrumentation scheme that enables programs written in multithreaded languages to compute a critical path at run time.Our scheme gives not only the length (ex...
167
click to vote
COMPGEOM
2000
ACM
15 years 9 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
176
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...