635 search results - page 14 / 127 » Some Computational Problems Related to Pseudo-intents |
AAAI
2007
14 years 12 months ago
2007
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
90
Voted
WORDS
2003
IEEE
15 years 2 months ago
2003
IEEE
We examine how computer system problems can be derived from real application problems, with a particular focus on the relevance of some assumptions, especially those related to co...
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper tackles an important aspect of the variational problems involving active contours, which has been largely overlooked so far: the optimization by gradient flows. Classic...
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...