1242 search results - page 181 / 249 » A Computational Complexity Theory in Membrane Computing |
151
click to vote
ECCC
2006
15 years 5 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
144
Voted
TALG
2010
15 years 4 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
154
Voted
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
159
Voted
SPAA
2009
ACM
16 years 18 days ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
181
Voted
EUSFLAT
2007
15 years 7 months ago
2007
At present time configurable wireless sensor networks are given special consideration. Wireless sensor networks are now a static elements union. To make such a network a powerful ...