4903 search results - page 335 / 981 » The Set Covering Machine |
180
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
150
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
160
click to vote
CIBSE
2009
ACM
16 years 1 months ago
2009
ACM
Model Driven Engineering (MDE) proposes a software development process in which software is built by constructing one or more models, and transforming these into other models. In t...
204
click to vote
ICCCN
2008
IEEE
16 years 1 months ago
2008
IEEE
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...
172
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...