Sciweavers

2128 search results - page 2 / 426
» A general characterization of indulgence
Sort
View
PE
2010
Springer
175views Optimization» more  PE 2010»
13 years 1 days ago
Generalized ERSS tree model: Revisiting working sets
Accurately characterizing the resource usage of an application at various levels in the memory hierarchy has been a long-standing research problem. Existing characterization studi...
Ricardo Koller, Akshat Verma, Raju Rangaswami
COMMA
2010
13 years 8 days ago
A characterization of collective conflict for defeasible argumentation
In this paper we define a recursive semantics for warrant in a general defeasible argumentation framework by formalizing a notion of collective (non-binary) conflict among argumen...
Teresa Alsinet, Ramón Béjar, Lluis G...
DAM
2011
13 years 8 days ago
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Richard Krueger, Geneviève Simonet, Anne Be...
CORR
2011
Springer
181views Education» more  CORR 2011»
13 years 9 days ago
Octal Bent Generalized Boolean Functions
In this paper we characterize (octal) bent generalized Boolean functions defined on Zn 2 with values in Z8. Moreover, we propose several constructions of such generalized bent fun...
Pante Stanica, Thor Martinsen
AAECC
2011
Springer
380views Algorithms» more  AAECC 2011»
13 years 10 days ago
The generalized road coloring problem and periodic digraphs
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman’s algorithm. Algebra...
G. Budzban, Ph. Feinsilver