844 search results - page 105 / 169 » Solving the p |
140
click to vote
MFCS
2009
Springer
16 years 14 days ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
197
Voted
KR
1992
Springer
15 years 10 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
158
click to vote
ICCS
1997
Springer
15 years 9 months ago
1997
Springer
: The need for analysis and modeling of knowledge has been espoused by many researchers as a prerequisite to building knowledge based systems (KBS). This approach has done little t...
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
137
click to vote
TCAD
1998
15 years 5 months ago
1998
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...