Sciweavers

1816 search results - page 76 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
HEURISTICS
2010
15 years 3 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
ECCC
2006
112views more  ECCC 2006»
15 years 6 months ago
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
WWW
2011
ACM
15 years 13 days ago
Web information extraction using Markov logic networks
In this paper, we consider the problem of extracting structured data from web pages taking into account both the content of individual attributes as well as the structure of pages...
Sandeepkumar Satpal, Sahely Bhadra, Sundararajan S...
ICIC
2007
Springer
16 years 3 days ago
A Hybrid Electromagnetism-Like Algorithm for Single Machine Scheduling Problem
Electromagnetism-like algorithm (EM) is a population-based meta-heuristic which has been proposed to solve continuous problems effectively. In this paper, we present a new meta-h...
Shih-Hsin Chen, Pei-Chann Chang, Chien-Lung Chan, ...
CVPR
2008
IEEE
16 years 8 months ago
Automatic symmetry plane estimation of bilateral objects in point clouds
In this paper, the problem of estimating automatically the symmetry plane of bilateral objects (having perfect or imperfect mirror symmetry) in point clouds is reexamined. Classic...
Benoît Combès, John Waddington, Neil ...