1018 search results - page 50 / 204 » Generative unbinding of names |
106
Voted
FOSSACS
2006
Springer
15 years 4 months ago
2006
Springer
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...
97
Voted
GEM
2007
15 years 2 months ago
2007
This paper presents a new method named “Life cycle model” for optimal placement of Distributed Generators in a distribution network. The impact of DG at the distribution level...
102
Voted
FORTE
2004
15 years 2 months ago
2004
Abstract. As its name indicates, NGSCB aims to be the "Next-Generation Secure Computing Base". As envisioned in the context of Trusted Computing initiatives, NGSCB provid...
100
Voted
JCT
2008
15 years 17 days ago
2008
Let T be an unrooted tree. The chromatic symmetric function XT , introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of T . The subtre...
82
Voted
NGC
2002
Springer
15 years 7 days ago
2002
Springer
Sequence design is a crucial problem in information-based biotechnology such as DNA-based computation. We introduce a simple strategy named template method that systematically gene...