499 search results - page 47 / 100 » Why neighbor-joining works |
SIGSOFT
2010
ACM
13 years 7 months ago
2010
ACM
Despite large volumes of data and many types of metrics, software projects continue to be difficult to predict and risky to conduct. In this paper we propose software analytics wh...
ICMLA
2009
13 years 7 months ago
2009
For many ranking applications we would like to understand not only which items are top-ranked, but also why they are top-ranked. However, many of the best ranking algorithms (e.g....
ICUMT
2009
13 years 7 months ago
2009
We define sensor middleware as the binding code mainly running between the sensor OS and applications g programming abstractions to bridge the gap between application developers an...
APWEB
2011
Springer
13 years 5 months ago
2011
Springer
One difficulty in the design of XML Schema is the restriction that the content models should be deterministic, i. e., the Unique Particle Attribution (UPA) constraint, which means ...
ASC
2011
13 years 5 months ago
2011
Evolutionary algorithms provide flexibility and robustness required to find satisfactory solutions in complex search spaces. This is why they are successfully applied for solvin...