Sciweavers

244 search results - page 29 / 49
» A study on the design issues of Memetic Algorithm
Sort
View
149
Voted
JCDL
2005
ACM
161views Education» more  JCDL 2005»
15 years 9 months ago
Downloading textual hidden web content through keyword queries
An ever-increasing amount of information on the Web today is available only through search interfaces: the users have to type in a set of keywords in a search form in order to acc...
Alexandros Ntoulas, Petros Zerfos, Junghoo Cho
162
Voted
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 10 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
146
Voted
FPGA
2007
ACM
150views FPGA» more  FPGA 2007»
15 years 9 months ago
FPGA-friendly code compression for horizontal microcoded custom IPs
Shrinking time-to-market and high demand for productivity has driven traditional hardware designers to use design methodologies that start from high-level languages. However, meet...
Bita Gorjiara, Daniel Gajski
FOCS
2000
IEEE
15 years 8 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
128
Voted
ICPP
2005
IEEE
15 years 9 months ago
Connected k-Hop Clustering in Ad Hoc Networks
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
Shuhui Yang, Jie Wu, Jiannong Cao