973 search results - page 155 / 195 » New Bounds on Crossing Numbers |
170
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...
157
click to vote
FSTTCS
2005
Springer
15 years 11 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
162
click to vote
IDA
2005
Springer
15 years 11 months ago
2005
Springer
Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterizat...
155
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
153
click to vote
SAT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...