674 search results - page 103 / 135 » From Constructibility and Absoluteness to Computability and ... |
197
click to vote
ICTAI
2009
IEEE
15 years 3 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
169
click to vote
ACSC
2009
IEEE
16 years 29 days ago
2009
IEEE
Most text mining methods are based on representing documents using a vector space model, commonly known as a bag of word model, where each document is modeled as a linear vector r...
167
click to vote
SIGECOM
2004
ACM
15 years 11 months ago
2004
ACM
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
181
click to vote
ICALP
2007
Springer
16 years 8 days 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...
160
click to vote
CONCUR
1992
Springer
15 years 10 months ago
1992
Springer
Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the "...