Sciweavers

3333 search results - page 82 / 667
» New Invariants for Groups
Sort
View
CAV
2012
Springer
198views Hardware» more  CAV 2012»
11 years 11 months ago
Termination Analysis with Algorithmic Learning
An algorithmic-learning-based termination analysis technique is presented. The new technique combines transition predicate abstraction, algorithmic learning, and decision procedure...
Wonchan Lee, Bow-Yaw Wang, Kwangkeun Yi
COMBINATORICS
2000
89views more  COMBINATORICS 2000»
13 years 8 months ago
Large Dihedral Symmetry of the Set of Alternating Sign Matrices
We prove a conjecture of Cohn and Propp, which refines a conjecture of Bosley and Fidkowski about the symmetry of the set of alternating sign matrices (ASMs). We examine data aris...
Benjamin Wieland
JSW
2007
112views more  JSW 2007»
13 years 8 months ago
The Challenge of Training New Architects: an Ontological and Reinforcement-Learning Methodology
— This paper describes the importance of new skilled architects in the discipline of Software and Enterprise Architecture. Architects are often idealized as super heroes with a l...
Anabel Fraga, Juan Lloréns
CHI
1998
ACM
14 years 1 months ago
Digital Manipulatives: New Toys to Think With
In many educationalsettings,manipulative materials(such as CuisenaireRods andPatternBlocks) play an important role in children’s learning, enabling children to explore mathemati...
Mitchel Resnick, Fred Martin, Robert Berg, Richard...
ISSAC
2007
Springer
112views Mathematics» more  ISSAC 2007»
14 years 3 months ago
G-graphs for the cage problem: a new upper bound
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
Alain Bretto, Luc Gillibert