Sciweavers

1940 search results - page 48 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
AAAI
2000
15 years 7 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
IJCAI
2003
15 years 7 months ago
A lookahead strategy for solving large planning problems
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Vincent Vidal
EUROPLOP
2006
15 years 7 months ago
Methods to Create and Use Cross-Domain Analysis Patterns
We present a set of methods to enable a cross-domain reuse of problem solutions via analysis patterns. First, problem-context descriptions and problemcontext models as well as sol...
Alexander Fülleborn, Maritta Heisel
ICCV
2007
IEEE
16 years 8 months ago
Global Optimization through Searching Rotation Space and Optimal Estimation of the Essential Matrix
This paper extends the set of problems for which a global solution can be found using modern optimization methods. In particular, the method is applied to estimation of the essent...
Richard I. Hartley, Fredrik Kahl
WECWIS
2009
IEEE
162views ECommerce» more  WECWIS 2009»
16 years 1 months ago
QoS-Driven Web Service Composition Using Learning-Based Depth First Search
—The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic feature...
Wonhong Nam, Hyunyoung Kil, Jungjae Lee