3019 search results - page 116 / 604 » Approximating the Domatic Number |
160
Voted
WADS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
160
click to vote
AAAI
2007
15 years 7 months ago
2007
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
167
Voted
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
145
Voted
DAGSTUHL
2007
15 years 6 months ago
2007
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
166
click to vote
SDM
2003
SIAM
15 years 6 months ago
2003
SIAM
Conventional sequential pattern mining methods may meet inherent difficulties in mining databases with long sequences and noise. They may generate a huge number of short and trivi...