44651 search results - page 244 / 8931 » Generalized |
179
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
176
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we present a general revision model on epistemic states based on plausibility measures proposed by Friedman and Halpern. We propose our revision strategy and give so...
149
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
184
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
167
click to vote
EKAW
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we propose a new methodology based on directed graphs and the TextRank algorithm to automatically induce general-specific noun relations from web corpora frequency c...