Sciweavers

53327 search results - page 10308 / 10666
» or 2007
Sort
View
184
Voted
CP
2007
Springer
16 years 1 months ago
Tradeoffs in the Complexity of Backdoor Detection
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
185
Voted
CP
2007
Springer
16 years 1 months ago
MiniZinc: Towards a Standard CP Modelling Language
Abstract. There is no standard modelling language for constraint programming (CP) problems. Most solvers have their own modelling language. This makes it difficult for modellers to...
Nicholas Nethercote, Peter J. Stuckey, Ralph Becke...
CPAIOR
2007
Springer
16 years 1 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
CPM
2007
Springer
115views Combinatorics» more  CPM 2007»
16 years 1 months ago
Two-Dimensional Range Minimum Queries
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed, answer on-line queries of the form “where is t...
Amihood Amir, Johannes Fischer, Moshe Lewenstein
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
16 years 1 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
« Prev « First page 10308 / 10666 Last » Next »