639 search results - page 1 / 128 » Dominance Constraints with Set Operators |
CL
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
ISPAN
2002
IEEE
13 years 10 months ago
2002
IEEE
Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in...
ICALP
1998
Springer
13 years 9 months ago
1998
Springer
CP
2007
Springer
13 years 11 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
PPSN
2004
Springer
13 years 10 months ago
2004
Springer
In spite of the recent quick growth of the Evolutionary Multi-objective Optimization (EMO) research field, there has been few trials to adapt the general variation operators to t...