Sciweavers

26 search results - page 1 / 6

» fct 2007

6

FCT
2007
Springer

63views Applied Computing» more FCT 2007»

The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable

13 years 11 months ago

The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable

Download www.math.muni.cz

Michal Kunc

claim paper

Read More »

10

FCT
2007
Springer

78views Applied Computing» more FCT 2007»

The Computational Complexity of Monotonicity in Probabilistic Networks

13 years 11 months ago

The Computational Complexity of Monotonicity in Probabilistic Networks

Download www.cs.uu.nl

Johan Kwisthout

claim paper

Read More »

11

FCT
2007
Springer

95views Applied Computing» more FCT 2007»

P Systems with Adjoining Controlled Communication Rules

13 years 11 months ago

P Systems with Adjoining Controlled Communication Rules

Download www.gcn.us.es

Mihai Ionescu, Dragos Sburlan

claim paper

Read More »

13

FCT
2007
Springer

102views Applied Computing» more FCT 2007»

Strictly Deterministic CD-Systems of Restarting Automata

13 years 11 months ago

Strictly Deterministic CD-Systems of Restarting Automata

Download kobra.bibliothek.uni-kassel.de

Hartmut Messerschmidt, Friedrich Otto

claim paper

Read More »

10

FCT
2007
Springer

104views Applied Computing» more FCT 2007»

Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs

13 years 11 months ago

Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs

Download www.cs.technion.ac.il

Hadas Shachnai, Omer Yehezkely

claim paper

Read More »

« Prev « First page 1 / 6 Last » Next »