21324 search results - page 382 / 4265 » Making the case for computing |
134
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...
130
click to vote
EUSFLAT
2007
15 years 6 months ago
2007
Parametric representation of fuzzy numbers (PFN) with derived methods for performing fuzzy arithmetic proves to have better accuracy and similar computational speed to using trian...
160
click to vote
AAAI
2006
15 years 6 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
118
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
142
Voted
AAAI
2000
15 years 6 months ago
2000
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...