11949 search results - page 333 / 2390 » Some results on (a:b)-choosability |
123
Voted
APNOMS
2007
Springer
15 years 8 months ago
2007
Springer
We propose a greedy algorithm to investigate the problem of how to schedule of a set of feasible transmissions under physical interference model. We also consider the fairness in s...
122
click to vote
CAV
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
103
click to vote
CIE
2007
Springer
15 years 8 months ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
124
click to vote
CIE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
114
click to vote
CLEAR
2007
Springer
15 years 8 months ago
2007
Springer
This paper presents the tracking system from Athens Information Technology that participated to the pedestrian and vehicle surveillance task of the CLEAR 2007 evaluations and the o...