1381 search results - page 98 / 277 » Computational Complexity of Constraint Satisfaction |
125
click to vote
ICCAD
2004
IEEE
16 years 1 months ago
2004
IEEE
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
131
click to vote
AMEC
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents iAuctionMaker as a novel tool that serves as a decision support for e-sourcing professionals on their pursuing of auction optimisation. Given a set of items to ...
143
click to vote
SPATIALCOGNITION
2004
Springer
15 years 9 months ago
2004
Springer
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
134
click to vote
AAAI
2000
15 years 5 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
151
click to vote
VLDB
2002
ACM
15 years 3 months ago
2002
ACM
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...