2181 search results - page 201 / 437 » The restriction scaffold problem |
122
click to vote
CADE
1997
Springer
15 years 8 months ago
1997
Springer
In this paper we study the completeness of resolution when it is restricted by a non-liftable order and by weak subsumption. A non-liftable order is an order that does not satisfy...
127
click to vote
PRICAI
2000
Springer
15 years 8 months ago
2000
Springer
The automated prediction of a user's interests and requirements is an area of interest to the Artificial Intelligence community. However, current predictive statistical approa...
143
click to vote
COLT
1995
Springer
15 years 8 months ago
1995
Springer
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
132
click to vote
ICCAD
1995
IEEE
15 years 8 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...
124
click to vote
ISSS
1995
IEEE
15 years 8 months ago
1995
IEEE
{DSP algorithms in most cases are subject to hard real-time constraints. In case of programmable DSP processors, meeting those constraints must be ensured by appropriate code gener...