2095 search results - page 251 / 419 » Improved pebbling bounds |
195
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
170
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...
182
click to vote
DAWAK
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
172
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
177
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...