6562 search results - page 35 / 1313 » Noetherianity and Combination Problems |
172
click to vote
WLP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...
138
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
155
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
We consider the problem of improving named entity recognition (NER) systems by using external dictionaries--more specifically, the problem of extending state-of-the-art NER system...
177
click to vote
AIPS
2006
15 years 7 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
126
click to vote
JSYML
2008
15 years 5 months ago
2008
I investigate versions of the Maximality Principles for the classes of forcings which are <-closed, <-directed-closed, or of the form Col(, < ). These principles come in ...