Sciweavers

Share
CATS
2008
9 years 2 months ago
On the Efficiency of Pollard's Rho Method for Discrete Logarithms
Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Ma...
Shi Bai, Richard P. Brent
CATS
2008
9 years 2 months ago
A Multidimensional Bisection Method for Unconstrained Minimization Problem
An extension of a new multidimensional bisection method for minimizing function over simplex is proposed for solving nonlinear unconstrained minimization problem. The method does ...
Elena Morozova
CATS
2008
9 years 2 months ago
Modelling for Lazy Clause Generation
Lazy clause generation is a hybrid SAT and finite domain propagation solver that tries to combine the advantages of both: succinct modelling using finite domains and powerful nogo...
Olga Ohrimenko, Peter J. Stuckey
CATS
2008
9 years 2 months ago
Testing Embeddability Between Metric Spaces
Ching-Lueh Chang, Yen-Wu Ti, Yuh-Dauh Lyuu
CATS
2008
9 years 2 months ago
Optimal Joint Vendor-Buyer Inventory Strategy for Deteriorating Items with Salvage Value
This study develops a joint optimal inventory strategy for both the buyer and the vendor when the expired stocks have salvage value, and are subject to constant rate of deteriorat...
Nita H. Shah, Ajay S. Gor, Hui Wee
CATS
2008
9 years 2 months ago
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
CATS
2008
9 years 2 months ago
Parameterized Complexity of the Clique Partition Problem
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
Egbert Mujuni, Frances A. Rosamond
CATS
2008
9 years 2 months ago
An ILP for the metro-line crossing problem
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
Matthew Asquith, Joachim Gudmundsson, Damian Merri...
CATS
2008
9 years 2 months ago
Tractable Cases of the Extended Global Cardinality Constraint
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
Marko Samer, Stefan Szeider
books