1964 search results - page 128 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
145
Voted
ICCBR
2009
Springer
15 years 5 days ago
2009
Springer
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...
131
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
230
Voted
VLDB
2003
ACM
16 years 2 months ago
2003
ACM
The Decomposition Storage Model (DSM) vertically partitions all attributes of a given relation. DSM has excellent I/O behavior when the number of attributes touched in the query i...
119
Voted
HPDC
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...
145
Voted
JSAT
2010
14 years 9 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...