Sciweavers

3267 search results - page 449 / 654
» Generalized quasirandom graphs
Sort
View
ICS
1995
Tsinghua U.
15 years 10 months ago
Optimum Modulo Schedules for Minimum Register Requirements
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
Alexandre E. Eichenberger, Edward S. Davidson, San...
KDD
1995
ACM
106views Data Mining» more  KDD 1995»
15 years 10 months ago
Structured and Unstructured Induction with EDAGs
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...
Brian R. Gaines
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 10 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
FLAIRS
2007
15 years 9 months ago
Interpretive Reasoning with Hypothetical Cases
Reasoning with hypothetical cases helps decision-makers evaluate alternate hypotheses for deciding a case. The hypotheticals demonstrate the sensitivity of a hypothesis to apparen...
Kevin D. Ashley
ATAL
2008
Springer
15 years 8 months ago
Stable cooperation in changing environments
This paper addresses the issue of emergence of robust cooperation among self-interested agents interacting in N-player social dilemma games. A series of graphs are created each ex...
Colm O'Riordan, Humphrey Sorensen