1092 search results - page 195 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
113
click to vote
CP
2004
Springer
15 years 7 months ago
2004
Springer
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
161
click to vote
PODS
1999
ACM
15 years 6 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
110
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
PR
2006
15 years 1 months ago
2006
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...
124
click to vote
SIGECOM
2008
ACM
15 years 1 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...