Sciweavers

8496 search results - page 18 / 1700
» Problem Solving and Complex Systems
Sort
View
ESOP
2009
Springer
13 years 11 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
MEMBRANE
2009
Springer
14 years 2 months ago
Tuning P Systems for Solving the Broadcasting Problem
Raluca Lefticaru, Florentin Ipate, Marian Gheorghe...
MEMBRANE
2009
Springer
14 years 2 months ago
Solving NP-Complete Problems by Spiking Neural P Systems with Budding Rules
Tseren-Onolt Ishdorj, Alberto Leporati, Linqiang P...