Sciweavers

8413 search results - page 246 / 1683
» Ordering Problem Subgoals
Sort
View
80
Voted
CORR
2007
Springer
119views Education» more  CORR 2007»
15 years 24 days ago
Hadwiger and Helly-type theorems for disjoint unit spheres
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
Otfried Cheong, Xavier Goaoc, Andreas Holmsen, Syl...
81
Voted
ICCBR
1999
Springer
15 years 5 months ago
Flexibly Interleaving Processes
We discuss several problems of analogy-driven proof plan construction which prevent a solution for more diæcult target problems or make a solution very expensive. Some of these pr...
Erica Melis, Carsten Ullrich
88
Voted
ECAI
2008
Springer
15 years 2 months ago
Hybrid tractable CSPs which generalize tree structure
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
Martin C. Cooper, Peter G. Jeavons, András ...
ANOR
2006
58views more  ANOR 2006»
15 years 27 days ago
A management system for decompositions in stochastic programming
This paper presents two contributions: A set of routines that manipulate instances of stochastic programming problems in order to make them more amenable for different solution ap...
Robert Fourer, Leo Lopes
111
Voted
SC
2005
ACM
15 years 6 months ago
Integrated Loop Optimizations for Data Locality Enhancement of Tensor Contraction Expressions
A very challenging issue for optimizing compilers is the phase ordering problem: In what order should a collection of compiler optimizations be performed? We address this problem ...
Swarup Kumar Sahoo, Sriram Krishnamoorthy, Rajkira...