Sciweavers

2410 search results - page 11 / 482
» Multiset Ordering Constraints
Sort
View
MOR
2006
80views more  MOR 2006»
14 years 9 months ago
The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implic
For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equival...
Defeng Sun
HEURISTICS
2006
102views more  HEURISTICS 2006»
14 years 9 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
AI
2006
Springer
14 years 9 months ago
Propagation algorithms for lexicographic ordering constraints
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian...
CP
1997
Springer
15 years 1 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...
GD
2005
Springer
15 years 3 months ago
Stress Majorization with Orthogonal Ordering Constraints
Force-directed placement is a widely used approach to automatically arranging the nodes and edges of a relational diagram or graph in an aesthetically pleasing manner. The adoption...
Tim Dwyer, Yehuda Koren, Kim Marriott