CATS
2008
14 years 11 days ago
2008
CATS
2008
14 years 11 days ago
2008
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...
CATS
2008
14 years 11 days ago
2008
An extension of a new multidimensional bisection method for minimizing function over simplex is proposed for solving nonlinear unconstrained minimization problem. The method does ...
CATS
2008
14 years 11 days ago
2008
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...
CATS
2008
14 years 11 days ago
2008
CATS
2008
14 years 11 days ago
2008
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...
CATS
2008
14 years 11 days ago
2008
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...
CATS
2008
14 years 11 days ago
2008
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 ...
CATS
2008
14 years 11 days ago
2008
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...
CATS
2008
14 years 11 days ago
2008
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...