Sciweavers

14386 search results - page 66 / 2878
» The Chinese Generals Problem
Sort
View
MOR
2002
94views more  MOR 2002»
15 years 2 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
NGC
2006
Springer
140views Communications» more  NGC 2006»
15 years 3 months ago
Re-representation and Creative Analogy: A Lexico-semantic Perspective
Analogy is a powerful boundary-transcending process that exploits a conceptual system's ability to perform controlled generalization in one domain and re-specialization into ...
Tony Veale
98
Voted
SIAMDM
2008
77views more  SIAMDM 2008»
15 years 3 months ago
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
Angel Corberán, Isaac Plana, José M....
BICOB
2009
Springer
15 years 9 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...
SAT
2004
Springer
101views Hardware» more  SAT 2004»
15 years 8 months ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...