1705 search results - page 149 / 341 » Representing Constraints with Automata |
124
Voted
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
148
click to vote
SMI
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
132
Voted
ICLP
2004
Springer
15 years 10 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
141
click to vote
KR
2004
Springer
15 years 10 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
147
Voted
UML
2004
Springer
15 years 10 months ago
2004
Springer
Being part of domain engineering, domain analysis enables identifying domains and capturing their ontologies in order to assist and guide system developers to design domain-specifi...