16843 search results - page 438 / 3369 » On Generalized Authorization Problems |
158
click to vote
EVOW
2003
Springer
16 years 1 days ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
204
click to vote
IMR
2003
Springer
16 years 7 hour ago
2003
Springer
The quality of numerical simulations of processes that are modeled by partial differential equations strongly depends on the quality of the mesh that is used for their discretiza...
191
click to vote
ISMVL
2000
IEEE
15 years 11 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
173
Voted
COMPGEOM
1994
ACM
15 years 11 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
170
click to vote
CEC
2009
IEEE
15 years 10 months ago
2009
IEEE
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...