2069 search results - page 273 / 414 » Linear time algorithms for Clobber |
194
click to vote
ACTA
2000
15 years 6 months ago
2000
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
186
click to vote
CADE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
177
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
143
click to vote
PVLDB
2010
15 years 4 months ago
2010
We propose the k-representative regret minimization query (k-regret) as an operation to support multi-criteria decision making. Like top-k, the k-regret query assumes that users h...
176
click to vote
ICDCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...