5330 search results - page 346 / 1066 » The Performability Tool P'ility |
230
click to vote
EAGC
2004
Springer
16 years 28 days ago
2004
Springer
Application monitoring in the grid for parallel applications is hardly supported in recent grid infrastructures. There is a need to visualize the behavior of the program during its...
228
click to vote
BMCBI
2005
15 years 7 months ago
2005
Background: Transcription factor binding site (TFBS) prediction is a difficult problem, which requires a good scoring function to discriminate between real binding sites and backg...
235
click to vote
SIGMOD
2012
ACM
13 years 10 months ago
2012
ACM
End-users increasingly find the need to perform light-weight, customized schema mapping. State-of-the-art tools provide powerful functions to generate schema mappings, but they u...
230
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Microarray experimentation requires the application of complex analysis methods as well as the use of non-trivial computer technologies to manage the resultant large d...
231
click to vote
SIGSOFT
2007
ACM
16 years 8 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...