4860 search results - page 290 / 972 » SNPs Problems, Complexity, and Algorithms |
112
Voted
SODA
2000
ACM
15 years 2 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
119
click to vote
ICCAD
1995
IEEE
15 years 4 months ago
1995
IEEE
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
140
click to vote
NIPS
2001
15 years 2 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
101
click to vote
WG
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
111
click to vote
AIR
1998
15 years 13 days ago
1998
Abstract. Genetic algorithms play a significant role, as search techniques for handling complex spaces, in many fields such as artificial intelligence, engineering, robotic, etc...