Sciweavers

549 search results - page 26 / 110
» The corner arc algorithm
Sort
View
WABI
2004
Springer
15 years 4 months ago
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
Jens Gramm
INFORMS
2008
55views more  INFORMS 2008»
14 years 11 months ago
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
April K. Andreas, J. Cole Smith
101
Voted
EOR
2007
90views more  EOR 2007»
14 years 11 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
WMCSA
2000
IEEE
15 years 3 months ago
ARC: A Bottom-Up Approach to Negotiated QoS
Mobile systems operate in a resource-scarce environment and thus must adapt to external conditions; all layers must make cost-based decisions about what mode of operation to use i...
Hylke W. van Dijk, Koen Langendoen, Henk J. Sips
CP
2008
Springer
15 years 26 days ago
Connecting ABT with Arc Consistency
ABT is the reference algorithm for asynchronous distributed constraint satisfaction. When searching, ABT produces nogoods as justifications of deleted values. When one of such nogo...
Ismel Brito, Pedro Meseguer