Sciweavers

1018 search results - page 50 / 204
» Generative unbinding of names
Sort
View
FOSSACS
2006
Springer
14 years 23 days ago
Parity Games Played on Transition Graphs of One-Counter Processes
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...
Olivier Serre
GEM
2007
13 years 10 months ago
A Life Cycle Model for Optimal DG Placement on Distribution Networks to Reduce Active Losses and Investment Costs
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...
Alireza Soroudi, Mehdi Ehsan
FORTE
2004
13 years 10 months ago
A Logical Account of NGSCB
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...
Martín Abadi, Ted Wobber
JCT
2008
86views more  JCT 2008»
13 years 9 months ago
On distinguishing trees by their chromatic symmetric functions
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...
Jeremy L. Martin, Matthew Morin, Jennifer D. Wagne...
NGC
2002
Springer
13 years 8 months ago
DNA Sequence Design Using Templates
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...
Masanori Arita, Satoshi Kobayashi