304 search results - page 34 / 61 » Solving Generalized Small Inverse Problems |
AAAI
1998
13 years 9 months ago
1998
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large e...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
EMSOFT
2004
Springer
14 years 1 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
BMCBI
2005
13 years 7 months ago
2005
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...