Sciweavers

6315 search results - page 1126 / 1263
» Approximating Solution Structure
Sort
View
CORR
2008
Springer
102views Education» more  CORR 2008»
13 years 10 months ago
Finding cores of random 2-SAT formulae via Poisson cloning
For the random 2-SAT formula F(n, p), let FC(n, p) be the formula left after the pure literal algorithm applied to F(n, p) stops. Using the recently developed Poisson cloning model...
Jeong Han Kim
CSDA
2008
150views more  CSDA 2008»
13 years 10 months ago
Unimodal regression via prefix isotonic regression
This paper gives algorithms for determining real-valued univariate unimodal regressions, that is, for determining the optimal regression which is increasing and then decreasing. S...
Quentin F. Stout
DAM
2008
84views more  DAM 2008»
13 years 10 months ago
Edge-splittings preserving local edge-connectivity of graphs
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
Zoltán Szigeti
DM
2008
112views more  DM 2008»
13 years 10 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
AIEDU
2006
77views more  AIEDU 2006»
13 years 10 months ago
Constraint-based Modeling and Ambiguity
Constraint-based modeling has been used in many application areas of Intelligent Tutoring Systems as a powerful means to analyse erroneous student solutions and generate helpful fe...
Wolfgang Menzel
« Prev « First page 1126 / 1263 Last » Next »