7167 search results - page 930 / 1434 » Answer Set Programming |
154
click to vote
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
138
click to vote
CSL
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...
126
click to vote
EGH
2004
Springer
15 years 10 months ago
2004
Springer
Texture mapping has been a fundamental feature for commodity graphics hardware. However, a key challenge for texture mapping is how to store and manage large textures on graphics ...
134
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
130
click to vote
DFT
2003
IEEE
15 years 10 months ago
2003
IEEE
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...