3663 search results - page 330 / 733 » Problems in the ontology of computer programs |
145
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
194
click to vote
IPPS
2006
IEEE
16 years 24 days ago
2006
IEEE
Protein sequences with unknown functionality are often compared to a set of known sequences to detect functional similarities. Efficient dynamic programming algorithms exist for t...
196
click to vote
IJIT
2004
15 years 8 months ago
2004
One of the major problems in genomic field is to perform sequence comparison on DNA and protein sequences. Executing sequence comparison on the DNA and protein data is a computatio...
207
Voted
CLUSTER
2009
IEEE
15 years 4 months ago
2009
IEEE
With the advent of high-performance COTS clusters, there is a need for a simple, scalable and faulttolerant parallel programming and execution paradigm. In this paper, we show that...
144
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In this paper we address a common question in wireless communication: How long does it take to satisfy an arbitrary set of wireless communication requests? This problem i...