364 search results - page 16 / 73 » Generalized normal forms and polynomial system solving |
TAPSOFT
1991
Springer
15 years 1 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
79
Voted
JAT
2010
14 years 8 months ago
2010
The paper investigates the properties of certain biorthogonal polynomials appearing in a specific simultaneous Hermite–Pad´e approximation scheme. Associated with any totally ...
ICDT
2010
ACM
15 years 1 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
A negotiation chain is formed when multiple related negotiations are spread over multiple agents. In order to appropriately order and structure the negotiations occurring in the c...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
The Web has been rapidly “deepened” by myriad searchable databases online, where data are hidden behind query forms. Helping users query alternative “deep Web” sources in ...