246 search results - page 30 / 50 » Dynamic Local Search for the Maximum Clique Problem |
180
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
Recent advances in research fields like multimedia and bioinformatics have brought about a new generation of hyper-dimensional databases which can contain hundreds or even thousan...
BIBE
2005
IEEE
15 years 3 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
TCAD
2002
14 years 9 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
Technology scaling has offered advantages to embedded systems, such as increased performance, more available memory and reduced energy consumption. However, scaling also brings a...
MOBIHOC
2004
ACM
15 years 9 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...