3019 search results - page 111 / 604 » Approximating the Domatic Number |
134
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
135
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
120
Voted
CEC
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...
130
click to vote
RTCSA
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
137
Voted
EMMCVPR
2005
Springer
2005
Springer
Exploiting Inference for Approximate Parameter Learning in Discriminative Fields: An Empirical Study
15 years 10 months ago
Abstract. Estimation of parameters of random field models from labeled training data is crucial for their good performance in many image analysis applications. In this paper, we p...