6575 search results - page 141 / 1315 » Specializing visualization algorithms |
201
click to vote
HPDC
1994
IEEE
15 years 10 months ago
1994
IEEE
Finding genes unequivocally in DNA sequences is one of the key goals of the Human Genome project. The human genome is a 9 billion character long DNA sequence and is estimated to c...
174
click to vote
CATS
2006
15 years 7 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
144
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
148
click to vote
AAAI
2000
15 years 7 months ago
2000
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously ...
187
click to vote
APDC
1997
15 years 7 months ago
1997
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...