16091 search results - page 436 / 3219 » Solving |
192
click to vote
AINA
2003
IEEE
15 years 10 months ago
2003
IEEE
In 1994, Harn proposed a signature scheme based on the modified ElGamal's scheme and claimed that the security relies on both of the factorization and the discrete logarithm....
192
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
147
click to vote
ISMIS
2000
Springer
15 years 10 months ago
2000
Springer
A good deal of progress has been made in the past few years in the design and implementation of control programs for autonomous agents. A natural extension of this work is to consi...
172
click to vote
CP
1995
Springer
15 years 10 months ago
1995
Springer
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
179
click to vote
WADS
1995
Springer
15 years 10 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...