Sciweavers

333 search results - page 19 / 67
» Speeding up moving-target search
Sort
View
EUROPAR
2008
Springer
14 years 12 months ago
Exploiting Hybrid Parallelism in Web Search Engines
Abstract. With the emergence of multi-core CPU (or Chip-level MultiProcessor -CMP-), it is essential to develop techniques that capitalize on CMP's advantages to speed up very...
Carolina Bonacic, Carlos García, Mauricio M...
GECCO
2008
Springer
108views Optimization» more  GECCO 2008»
14 years 11 months ago
Search space reduction technique for constrained optimization with tiny feasible space
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
Abu S. S. M. Barkat Ullah, Ruhul A. Sarker, David ...
DASFAA
2009
IEEE
93views Database» more  DASFAA 2009»
15 years 5 months ago
Top-K Correlation Sub-graph Search in Graph Databases
Recently, due to its wide applications, (similar) subgraph search has attracted a lot of attentions from database and data mining community, such as [13, 18, 19, 5]. In [8], Ke et ...
Lei Zou, Lei Chen 0002, Yansheng Lu
ICTAI
2006
IEEE
15 years 4 months ago
Efficient Search Using Bitboard Models
This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpret...
Pablo San Segundo, Ramón Galán, Fern...
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
15 years 3 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...