Sciweavers

3055 search results - page 408 / 611
» Randomized Search Trees
Sort
View
AINA
2009
IEEE
15 years 11 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
ICDE
2009
IEEE
126views Database» more  ICDE 2009»
15 years 11 months ago
Querying Communities in Relational Databases
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speci...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao
AGILE
2009
Springer
210views GIS» more  AGILE 2009»
15 years 10 months ago
Detecting Hotspots in Geographic Networks
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
Kevin Buchin, Sergio Cabello, Joachim Gudmundsson,...
CP
2007
Springer
15 years 10 months ago
Encodings of the Sequence Constraint
Abstract. The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constra...
Sebastian Brand, Nina Narodytska, Claude-Guy Quimp...
GECCO
2005
Springer
15 years 9 months ago
Evaluating GP schema in context
We propose a new methodology to look at the fitness contributions (semantics) of different schemata in Genetic Programming (GP). We hypothesize that the significance of a schem...
Hammad Majeed, Conor Ryan, R. Muhammad Atif Azad