10988 search results - page 194 / 2198 » Algorithmic Folding Complexity |
123
Voted
ARITH
2003
IEEE
15 years 9 months ago
2003
IEEE
Multiplication of two numbers represented in base is shown to be computable by an on-line algorithm when is a negative integer, a positive non-integer real number, or a comp...
118
Voted
ESANN
2006
15 years 5 months ago
2006
Complex networks have received much attention in the last few years, and reveal global properties of interacting systems in domains like biology, social sciences and technology. O...
151
Voted
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
127
Voted
ICDT
2010
ACM
15 years 7 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
117
Voted
COR
2008
15 years 3 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...