Sciweavers

882 search results - page 103 / 177
» Local Search for Very Large SAT Problems
Sort
View
JDA
2008
87views more  JDA 2008»
15 years 4 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
FLAIRS
2003
15 years 5 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
138
Voted
CDES
2008
123views Hardware» more  CDES 2008»
15 years 5 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...
MP
2002
84views more  MP 2002»
15 years 3 months ago
A decomposition procedure based on approximate Newton directions
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
Antonio J. Conejo, Francisco J. Nogales, Francisco...
ICC
2007
IEEE
15 years 10 months ago
A Cost-Effective Approach to Optical Packet/burst Scheduling
Abstract— Optical Burst and Packet Switching are being considered as the most promising paradigms to increase bandwidth efficiency in IP over DWDM networks. In both cases, due t...
Franco Callegati, Aldo Campi, Walter Cerroni