1872 search results - page 372 / 375 » The Art of Granular Computing |
202
Voted
AI
2011
Springer
15 years 19 days ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
203
click to vote
CCR
2011
15 years 19 days ago
2011
ion can improve performance without significantly breaking layered abstractions; explicit bursts are preferable to steady, constant bitrate traffic. Furthermore, the vagaries and c...
171
Voted
CORR
2011
Springer
15 years 18 days ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
181
Voted
BMCBI
2011
14 years 9 months ago
2011
Background: Over the past few years, new massively parallel DNA sequencing technologies have emerged. These platforms generate massive amounts of data per run, greatly reducing th...
174
click to vote
PAMI
2011
14 years 8 months ago
2011
— Projection methods have been used in the analysis of bi-tonal document images for different tasks like page segmentation and skew correction for over two decades. However, thes...