11949 search results - page 2159 / 2390 » Some results on (a:b)-choosability |
128
click to vote
COCO
2005
Springer
15 years 7 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
109
click to vote
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
Multicast routing uses a structure, either a tree or a mesh, to connect the receivers to the source, thus saving the bandwidth. How to share the cost among the receivers in a certa...
101
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
112
click to vote
ECAL
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This paper presents a model of the co-evolution of transmissible disease and a population of non-randomly mixed susceptible agents. The presence of the disease elements i...
149
click to vote
ECMDAFA
2005
Springer
15 years 7 months ago
2005
Springer
The model-driven software development for hard real-time systems promotes the usage of the platform independent model as major design artifact. It is used to develop the software l...