Sciweavers

4913 search results - page 108 / 983
» Results and Perspectives of the G
Sort
View
AAAI
2008
14 years 20 days ago
Integrating Multiple Learning Components through Markov Logic
This paper addresses the question of how statistical learning algorithms can be integrated into a larger AI system both from a practical engineering perspective and from the persp...
Thomas G. Dietterich, Xinlong Bao
CHI
2011
ACM
13 years 1 months ago
Designing sports: a framework for exertion games
Exertion games require investing physical effort. The fact that such games can support physical health is tempered by our limited understanding of how to design for engaging exert...
Florian Mueller, Darren Edge, Frank Vetere, Martin...
COMBINATORICS
2002
88views more  COMBINATORICS 2002»
13 years 10 months ago
Graph Color Extensions: When Hadwiger's Conjecture and Embeddings Help
Suppose G is r-colorable and P V (G) is such that the components of G[P] are far apart. We show that any (r + s)-coloring of G[P] in which each component is s-colored extends to ...
Michael O. Albertson, Joan P. Hutchinson
AUSAI
2007
Springer
14 years 2 months ago
Advances in Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
SPAA
2004
ACM
14 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter