Sciweavers

5030 search results - page 267 / 1006
» cases 2007
Sort
View
IJCAI
1993
15 years 8 months ago
Diagnosing and Solving Over-Determined Constraint Satisfaction Problems
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
R. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognu...
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
15 years 8 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
CCE
2008
15 years 7 months ago
Chemical supply chain network optimization
Chemical supply chain networks provide large opportunities for cost reductions through the redesign of the flow of material from producer to customer. In this paper we present a m...
Jeff Ferrio, John Wassick
ALMOB
2006
80views more  ALMOB 2006»
15 years 7 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
APIN
2006
109views more  APIN 2006»
15 years 7 months ago
Visual analogy: Viewing analogical retrieval and mapping as constraint satisfaction problems
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing ...
Patrick W. Yaner, Ashok K. Goel