13th International Conference on Membrane Computing - MTA Sztaki

More documents

Recommendations

Info

H. ElGindy, R. Nicolescu, H. Wu 12. Nicolescu, R., Wu, H.: New solutions for disjoint paths in P systems. Report CDMTCS-417, Centre for Discrete Mathematics and Theoretical Computer Science, The University of Auckland, Auckland, New Zealand (March 2012) 13. Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000) 14. Păun, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press, Inc., New York, NY, USA (2010) 15. Seo, D., Thottethodi, M.: Disjoint-path routing: Efficient communication for streaming applications. In: IPDPS. pp. 1–12. IEEE (2009) 16. Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press (2000) 17. Wikipedia: Multipath routing—Wikipedia, the free encyclopedia (2011), http: //en.wikipedia.org/wiki/Multipath_routing, [Online; accessed 14-December- 2011] 196
Fast distributed DFS solutions for edge-disjoint paths in digraphs Table 3. Experimental runtime comparison of Algorithms A, B, C, C ∗ and D on 30 random digraphs, with n = 100 cells, m = 300 arcs. Test f Algorithm A Algorithm B Algorithm C Algorithm C ∗ Algorithm D case steps steps gain% steps gain% steps gain% steps gain% over A over A over A over A 1 1 135 97 28 97 28 97 28 97 28 2 0 13 13 0 13 0 13 0 13 0 3 2 1198 513 57 499 58 658 45 492 59 4 3 1372 616 55 541 61 590 57 540 61 5 3 671 359 46 351 48 351 48 351 48 6 1 383 193 50 193 50 193 50 193 50 7 4 1458 677 54 669 54 838 43 666 54 8 1 641 269 58 267 58 267 58 265 59 9 3 147 123 16 123 16 123 16 123 16 10 2 225 173 23 171 24 171 24 171 24 11 2 1020 435 57 445 56 610 40 436 57 12 4 333 213 36 207 38 209 37 207 38 13 1 274 156 43 149 46 156 43 149 46 14 1 160 108 33 108 33 108 33 108 33 15 1 821 340 59 357 57 509 38 335 59 16 2 960 451 53 470 51 616 36 440 54 17 1 822 334 59 329 60 328 60 328 60 18 4 1388 606 56 570 59 590 57 570 59 19 2 1302 553 58 508 61 726 44 508 61 20 2 194 146 25 146 25 146 25 146 25 21 2 566 294 48 290 49 290 49 290 49 22 2 1420 566 60 548 61 556 61 547 61 23 1 134 98 27 98 27 98 27 98 27 24 4 1093 525 52 509 53 511 53 509 53 25 1 27 27 0 27 0 27 0 27 0 26 3 1151 504 56 478 58 647 44 475 59 27 3 385 259 33 253 34 253 34 253 34 28 0 13 13 0 13 0 13 0 13 0 29 2 660 326 51 319 52 320 52 319 52 30 3 391 247 37 243 38 243 38 243 38 197
Page 1:
Erzsébet Csuhaj-Varjú Marian Gheo
Page 4 and 5:
Editors Erzsébet Csuhaj-Varjú Dep
Page 6 and 7:
Preface In addition to the texts or
Page 8 and 9:
Contents M.A. Martínez-del-Amor, I
Page 11 and 12:
13th Inter
Page 13 and 14:
(Tissue) P systems with decaying ob
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35:
Page 38 and 39:
Sorin Istrail, Solomon Marcus of pr
Page 40 and 41:
Sorin Istrail, Solomon Marcus proba
Page 42 and 43:
Sorin Istrail, Solomon Marcus stati
Page 44 and 45:
Sorin Istrail, Solomon Marcus 4.
Page 46 and 47:
Sorin Istrail, Solomon Marcus his f
Page 49 and 50:
13th Inter
Page 51 and 52:
Turing’s three pioneering initiat
Page 53 and 54:
Turing’s three pioneering initiat
Page 55 and 56:
13th Inter
Page 57:
MP systems for systems biology tere
Page 60 and 61:
Yu. Rogozhin this obstacle and to g
Page 62 and 63:
Yu. Rogozhin 10. J. Cocke, M. Minsk
Page 64 and 65:
M. Stannett The question arises, wh
Page 67:
Regular Contributions
Page 70 and 71:
T. Ahmed, G. DeLancy, A. Paun almos
Page 72 and 73:
T. Ahmed, G. DeLancy, A. Paun purpo
Page 74 and 75:
T. Ahmed, G. DeLancy, A. Paun Fig.
Page 76 and 77:
T. Ahmed, G. DeLancy, A. Paun gener
Page 78 and 79:
T. Ahmed, G. DeLancy, A. Paun
Page 80 and 81:
T. Ahmed, G. DeLancy, A. Paun Table
Page 82 and 83:
T. Ahmed, G. DeLancy, A. Paun 14. H
Page 84 and 85:
T. Ahmed, G. DeLancy, A. Paun 84
Page 87 and 88:
13th Inter
Page 89 and 90:
Asynchronuous and maximally paralle
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97:
Page 100 and 101:
A. Alhazov, R. Freund, H. Heikenwä
Page 102 and 103:
Page 104 and 105:
Page 106 and 107:
Page 108 and 109:
Page 110 and 111:
Page 112 and 113:
Page 114 and 115:
Page 116 and 117:
A. Alhazov, Yu. Rogozhin With coope
Page 118 and 119:
A. Alhazov, Yu. Rogozhin 2.3 P Syst
Page 120 and 121:
A. Alhazov, Yu. Rogozhin Such a sys
Page 122 and 123:
A. Alhazov, Yu. Rogozhin applied, f
Page 124 and 125:
A. Alhazov, Yu. Rogozhin - one extr
Page 126 and 127:
B. Aman, G. Ciobanu formalisms is e
Page 128 and 129:
B. Aman, G. Ciobanu membranes appea
Page 130 and 131:
B. Aman, G. Ciobanu • [ ] recep r
Page 132 and 133:
B. Aman, G. Ciobanu Definition 3. A
Page 134 and 135:
B. Aman, G. Ciobanu { w i , for all
Page 136 and 137:
B. Aman, G. Ciobanu The four transi
Page 138 and 139:
B. Aman, G. Ciobanu A state space i
Page 140 and 141:
B. Aman, G. Ciobanu to reiterate th
Page 143 and 144:
13th Inter
Page 145 and 146: On structures and behaviors of spik
Page 159: On structures and behaviors of spik
Page 162 and 163: L. Cienciala, L. Ciencialová, M. P
Page 172 and 173: H. ElGindy, R. Nicolescu, H. Wu pat
Page 174 and 175: H. ElGindy, R. Nicolescu, H. Wu pro
Page 176 and 177: H. ElGindy, R. Nicolescu, H. Wu (b)
Page 178 and 179: H. ElGindy, R. Nicolescu, H. Wu 8 r
Page 180 and 181: H. ElGindy, R. Nicolescu, H. Wu Pse
Page 182 and 183: H. ElGindy, R. Nicolescu, H. Wu to
Page 184 and 185: H. ElGindy, R. Nicolescu, H. Wu ter
Page 186 and 187: H. ElGindy, R. Nicolescu, H. Wu 4.
Page 188 and 189: H. ElGindy, R. Nicolescu, H. Wu Tab
Page 190 and 191: H. ElGindy, R. Nicolescu, H. Wu 4.
Page 192 and 193: H. ElGindy, R. Nicolescu, H. Wu 6 R
Page 194 and 195: H. ElGindy, R. Nicolescu, H. Wu (wh
Page 199 and 200: 13th Inter
Page 201 and 202: A formal framework for P systems wi
Page 213 and 214: A new approach for solving SAT by P
Page 223 and 224: Maintenance of chronobiological inf
Page 231 and 232: 4 3.5 3 2.5 2 1.5 1 0.5 0 0 50 100
Page 245 and 246: Using a kernel P system to solve th
Page 247 and 248:
Using a kernel P system to solve th
Page 249 and 250:
Page 251 and 252:
Page 253 and 254:
Page 255 and 256:
Page 257 and 258:
Page 259 and 260:
13th Inter
Page 261 and 262:
Spiking neural P systems with funct
Page 263 and 264:
Page 265 and 266:
Page 267 and 268:
Page 269 and 270:
Page 271 and 272:
Page 273 and 274:
Page 275:
Page 278 and 279:
L.F. Macías-Ramos, M.J. Pérez-Jim
Page 280 and 281:
Page 282 and 283:
Page 284 and 285:
Page 286 and 287:
Page 288 and 289:
Page 290 and 291:
Page 292 and 293:
M.A. Martínez-del-Amor, I. Pérez-
Page 294 and 295:
Page 296 and 297:
Page 298 and 299:
Page 300 and 301:
Page 302 and 303:
Page 304 and 305:
Page 306 and 307:
Page 308 and 309:
Page 311 and 312:
13th Inter
Page 313 and 314:
Membranes with local environments A
Page 315 and 316:
Membranes with local environments T
Page 317 and 318:
Membranes with local environments -
Page 319 and 320:
Membranes with local environments -
Page 321 and 322:
Membranes with local environments I
Page 323 and 324:
13th Inter
Page 325 and 326:
On efficient algorithms for SAT dis
Page 327 and 328:
On efficient algorithms for SAT 2 S
Page 329 and 330:
On efficient algorithms for SAT 2.4
Page 331 and 332:
On efficient algorithms for SAT inc
Page 333 and 334:
On efficient algorithms for SAT •
Page 335 and 336:
On efficient algorithms for SAT Not
Page 337 and 338:
On efficient algorithms for SAT the
Page 339:
On efficient algorithms for SAT 32.
Page 342 and 343:
A. Obtu̷lowicz - its underlying tr
Page 344 and 345:
A. Obtu̷lowicz 2−ramification
Page 346 and 347:
A. Obtu̷lowicz The correctness of
Page 348 and 349:
A. Obtu̷lowicz The arcs (links) fr
Page 351 and 352:
13th Inter
Page 353 and 354:
An analysis of correlative and quan
Page 355 and 356:
Page 357 and 358:
Page 359 and 360:
Page 361 and 362:
Page 363 and 364:
Page 365 and 366:
Page 367 and 368:
Page 369 and 370:
13th Inter
Page 371 and 372:
Sublinear-space P systems with acti
Page 373 and 374:
Page 375 and 376:
Page 377 and 378:
Page 379 and 380:
Page 381 and 382:
Page 383 and 384:
Page 385 and 386:
13th Inter
Page 387 and 388:
Modelling ecological systems with t
Page 389 and 390:
Page 391 and 392:
Page 393 and 394:
Page 395 and 396:
Page 397 and 398:
Page 399 and 400:
Page 401 and 402:
Page 403 and 404:
Page 405:
Page 408 and 409:
D. Sburlan hence one can gather use
Page 410 and 411:
D. Sburlan represents a 0L system.
Page 412 and 413:
D. Sburlan assuming that M is in a
Page 414 and 415:
D. Sburlan q 1 {t−, T 1 ↓, T 2
Page 416 and 417:
D. Sburlan In case of M, the states
Page 418 and 419:
D. Sburlan We introduced a formal s
Page 420 and 421:
P. Sosík [9, 10], several research
Page 422 and 423:
P. Sosík The rules of a system lik
Page 424 and 425:
P. Sosík 1. The family Π is polyn
Page 426 and 427:
P. Sosík (a) subsequently and recu
Page 428 and 429:
P. Sosík contentFinal = content(l,
Page 430 and 431:
P. Sosík Hence, with the aid of th
Page 432 and 433:
P. Sosík 8. Lakshmanan K. and Rama
Page 434 and 435:
S. Verlan, J. Quiros more relevance
Page 436 and 437:
S. Verlan, J. Quiros For a regular
Page 438 and 439:
S. Verlan, J. Quiros digital FPGA c
Page 440 and 441:
S. Verlan, J. Quiros where k j = N
Page 442 and 443:
S. Verlan, J. Quiros Now let us con
Page 444 and 445:
S. Verlan, J. Quiros We consider a
Page 446 and 447:
S. Verlan, J. Quiros the present co
Page 448 and 449:
S. Verlan, J. Quiros Table 2 gives
Page 450 and 451:
S. Verlan, J. Quiros Using similar
Page 452 and 453:
S. Verlan, J. Quiros 5. M. Maliţa,
Page 455 and 456:
13th Inter
Page 457 and 458:
Simplifying Event-B models of P sys
Page 461:
Author Index Adorna H., 143 Agrigor
show all

13th International Conference on Membrane Computing - MTA Sztaki

Create successful ePaper yourself

Delete template?

Save as template?