Sciweavers

8413 search results - page 111 / 1683
» Ordering Problem Subgoals
Sort
View
IJCAI
1989
13 years 9 months ago
Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of p...
Rina Dechter, Itay Meiri
COMPUTING
2002
93views more  COMPUTING 2002»
13 years 8 months ago
Non-Nested Multi-Level Solvers for Finite Element Discretisations of Mixed Problems
We consider a general framework for analysing the convergence of multi-grid solvers applied to finite element discretisations of mixed problems, both of conforming and nonconformi...
V. John, P. Knobloch, Gunar Matthies, Lutz Tobiska
FUIN
2007
135views more  FUIN 2007»
13 years 8 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner
CGO
2006
IEEE
14 years 2 months ago
Exhaustive Optimization Phase Order Space Exploration
The phase-ordering problem is a long standing issue for compiler writers. Most optimizing compilers typically have numerous different code-improving phases, many of which can be a...
Prasad Kulkarni, David B. Whalley, Gary S. Tyson, ...
TCBB
2008
117views more  TCBB 2008»
13 years 8 months ago
Consensus Genetic Maps as Median Orders from Inconsistent Sources
A genetic map is an ordering of genetic markers calculated from a population of known lineage. Although, traditionally, a map has been generated from a single population for each s...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...