2446 search results - page 479 / 490 » Choiceless Polynomial Time |
ALMOB
2006
13 years 7 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
BMCBI
2006
13 years 7 months ago
2006
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...
COMCOM
2006
13 years 7 months ago
2006
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
COMCOM
2006
13 years 7 months ago
2006
In relation to its growth in size and user population, the Internet faces new challenges that have triggered the proposals of value-added network services, e.g., IP multicast, IP ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...