1008 search results - page 195 / 202 » Canonicity! |
CORR
2008
Springer
14 years 10 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...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
for an informal presentation at CIE 2007 [2] is a typed -calculus that pursues the reuse of the term constructions both at the level of types and at the level of contexts, while en...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
BMCBI
2007
14 years 10 months ago
2007
Background: Efforts to predict functional sites from globular proteins is increasingly common; however, the most successful of these methods generally require structural insight. ...
CN
2007
14 years 10 months ago
2007
The distributed partitioning of autonomous, self-aware nodes into cooperative groups, within which scarce resources could be effectively shared for the benefit of the group, is ...