4103 search results - page 160 / 821 » Some results on the Collatz problem |
164
click to vote
DAC
1999
ACM
16 years 7 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
177
click to vote
ICCD
2007
IEEE
16 years 3 months ago
2007
IEEE
In this paper, we present co-processor selection problem for minimum energy consumption in hw/sw co-design on FPGAs with dual power mode. We provide theoretical analysis for the p...
171
Voted
LPAR
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
172
click to vote
PUK
2000
15 years 8 months ago
2000
GraphPlan-like and SATPLAN-like planners have shown to outperform classical planners for most of the classical planning domains. However, these two propositional approaches do not ...
166
click to vote
IANDC
2008
15 years 6 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...