13376 search results - page 434 / 2676 » Problem Solving with |
132
Voted
ACMSE
2006
ACM
15 years 11 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
135
click to vote
ICCS
2004
Springer
15 years 10 months ago
2004
Springer
Distributed computing in wide area networks requires special approach to solve the problem of communication between secure areas. Since there is no possibility to establish connect...
153
Voted
COMPGEOM
1995
ACM
15 years 8 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
139
click to vote
GI
2009
Springer
15 years 9 months ago
2009
Springer
: Compliance management tackles issues related to both modelling and enforcement of business constraints in enterprises. In the context of business process management, we propose a...
126
click to vote
SIAMJO
2010
14 years 11 months ago
2010
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...