Sciweavers

3628 search results - page 148 / 726
» The Decision Diffie-Hellman Problem
Sort
View
STACS
2007
Springer
14 years 3 months ago
Enumerating All Solutions for Constraint Satisfaction Problems
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
Henning Schnoor, Ilka Schnoor
CSR
2010
Springer
14 years 2 months ago
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimi...
James Gate, Iain A. Stewart
SEAL
1998
Springer
14 years 1 months ago
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem
Abstract. This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research we...
Edmund K. Burke, Patrick De Causmaecker, Greet Van...
DBPL
2007
Springer
158views Database» more  DBPL 2007»
14 years 1 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens
TRANSCI
2002
106views more  TRANSCI 2002»
13 years 9 months ago
The Stochastic Inventory Routing Problem with Direct Deliveries
Vendor managed inventory replenishment is a business practice in which vendors monitor their customers' inventories, and decide when and how much inventory should be replenis...
Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Sav...