1484 search results - page 150 / 297 » Ants meeting algorithms |
131
click to vote
PKDD
2004
Springer
15 years 3 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
81
Voted
GLVLSI
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we discuss a methodology to design and synthesize analog CMOS components such as RF amplifiers. The inputs of the synthesis tool are the circuit specifications desc...
DAC
1994
ACM
15 years 2 months ago
1994
ACM
Existing software scheduling techniques limit the functions that can be implemented in software to those with a restricted class of timing constraints, in particular those with a c...
DBKDA
2009
IEEE
15 years 2 months ago
2009
IEEE
Metadata harvesting requires timely propagation of up-to-date information from thousands of Repositories over a wide area network. It is desirable to keep the data as fresh as poss...
GLOBECOM
2007
IEEE
15 years 2 months ago
2007
IEEE
We consider optimal allocation of resources to users in a downlink OFDMA system to support heterogeneous applications consisting of both deadline-sensitive (DS) and best-effort (BE...