6562 search results - page 35 / 1313 » Noetherianity and Combination Problems |
121
Voted
WLP
2005
Springer
15 years 6 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...
83
Voted
ICCAD
1997
IEEE
15 years 4 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...
105
Voted
KDD
2004
ACM
16 years 1 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...
111
click to vote
AIPS
2006
15 years 2 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 ...
77
Voted
JSYML
2008
15 years 19 days 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 ...