Sciweavers

365 search results - page 61 / 73
» On the combinatorics of Galois numbers
Sort
View
MST
2006
106views more  MST 2006»
14 years 11 months ago
More Fun with Symmetric Venn Diagrams
Abstract. Many researchers have had fun searching for and rendering symmetric Venn diagrams, culminating in the recent result of Griggs, Killian, and Savage ("Venn Diagrams an...
Frank Ruskey, Mark Weston
TALG
2008
97views more  TALG 2008»
14 years 11 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
ICST
2010
IEEE
14 years 10 months ago
Automated and Scalable T-wise Test Case Generation Strategies for Software Product Lines
Abstract—Software Product Lines (SPL) are difficult to validate due to combinatorics induced by variability across their features. This leads to combinatorial explosion of the n...
Gilles Perrouin, Sagar Sen, Jacques Klein, Benoit ...
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
15 years 6 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
COCOON
2009
Springer
15 years 6 months ago
Online Tree Node Assignment with Resource Augmentation
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung...