Sciweavers

14386 search results - page 238 / 2878
» The Chinese Generals Problem
Sort
View
MP
2002
86views more  MP 2002»
15 years 4 months ago
Multistars, partial multistars and the capacitated vehicle routing problem
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...
Adam N. Letchford, Richard W. Eglese, Jens Lysgaar...
117
Voted
PODC
2009
ACM
15 years 11 months ago
Brief announcement: new bounds for the controller problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic distributed tool that an abstraction for managing the consumption of a global resource i...
Yuval Emek, Amos Korman
111
Voted
SPIRE
2004
Springer
15 years 10 months ago
Linear Time Algorithm for the Longest Common Repeat Problem
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
GECCO
2010
Springer
172views Optimization» more  GECCO 2010»
15 years 9 months ago
Biogeography-based optimization with blended migration for constrained optimization problems
Biogeography-based optimization (BBO) is a new evolutionary algorithm based on the science of biogeography. We propose two extensions to BBO. First, we propose blended migration. ...
Haiping Ma, Dan Simon
IPCO
2007
81views Optimization» more  IPCO 2007»
15 years 6 months ago
Matching Problems in Polymatroids Without Double Circuits
According to the present state of the theory of the matroid matching problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of ...
Márton Makai, Gyula Pap, Jácint Szab...