385 search results - page 26 / 77 » constraints 1999 |
97
Voted
DEBU
1999
15 years 6 days ago
1999
WOL is a Horn-clause language for specifying transformations involving complex types and recursive data-structures. Its declarative syntax makes programs easy to modify in respons...
92
Voted
AAECC
1999
Springer
15 years 6 days ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
116
click to vote
CORR
1999
Springer
15 years 6 days ago
1999
Springer
We propose a parser for constraintlogic grammars implementing HPSG that combines the advantages of dynamic bottom-up and advanced topdown control. The parser allows the user to ap...
129
click to vote
CONSTRAINTS
1999
15 years 6 days ago
1999
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
103
click to vote
RTSS
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arb...