Sciweavers

6562 search results - page 101 / 1313
» Noetherianity and Combination Problems
Sort
View
JCDL
2005
ACM
138views Education» more  JCDL 2005»
15 years 6 months ago
Comparative study of name disambiguation problem using a scalable blocking-based framework
In this paper, we consider the problem of ambiguous author names in bibliographic citations, and comparatively study alternative approaches to identify and correct such name varia...
Byung-Won On, Dongwon Lee, Jaewoo Kang, Prasenjit ...
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
15 years 5 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi
CIBCB
2008
IEEE
15 years 7 months ago
Parallel multi-objective algorithms for the molecular docking problem
— Molecular docking is an essential tool for drug design. It helps the scientist to rapidly know if two molecules, respectively called ligand and receptor, can be combined togeth...
Jean-Charles Boisson, Laetitia Jourdan, El-Ghazali...
LION
2010
Springer
307views Optimization» more  LION 2010»
15 years 6 months ago
A Column Generation Heuristic for the General Vehicle Routing Problem
This paper presents a column generation heuristic for the general vehicle routing problem (GVRP), a combined load acceptance and rich vehicle routing problem incorporating various ...
Asvin Goel
ESA
2007
Springer
143views Algorithms» more  ESA 2007»
15 years 7 months ago
Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
Chien-Chung Huang