Sciweavers

4451 search results - page 23 / 891
» On Random Ordering Constraints
Sort
View
ECAI
2004
Springer
15 years 5 months ago
Soft Constraints with Partially Ordered Preferences
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, th...
Nic Wilson
EOR
2000
64views more  EOR 2000»
14 years 11 months ago
Multiobjective second order symmetric duality with cone constraints
We introduce two pairs of nondifferentiable multiobjective second order symmetric dual problems with cone constraints over arbitrary closed convex cones, which is different from th...
S. K. Mishra
CP
2000
Springer
15 years 3 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
CVPR
2008
IEEE
16 years 1 months ago
Graph cut with ordering constraints on labels and its applications
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu
FLAIRS
2004
15 years 1 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar