Sciweavers

5964 search results - page 396 / 1193
» A theory of speculative computation
Sort
View
252
Voted
DISOPT
2011
201views Education» more  DISOPT 2011»
14 years 11 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
JMLR
2012
13 years 10 months ago
Sparse Additive Machine
We develop a high dimensional nonparametric classification method named sparse additive machine (SAM), which can be viewed as a functional version of support vector machine (SVM)...
Tuo Zhao, Han Liu
WM
2003
15 years 9 months ago
Worlds, Models, and KM
Techniques for computation on generalized diagrams are defined and the KM implications are explored. Descriptive Computing is presented and plan computation based on world models t...
Cyrus F. Nourani
218
Voted
STACS
2009
Springer
16 years 2 months ago
Forward Analysis for WSTS, Part I: Completions
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
Alain Finkel, Jean Goubault-Larrecq
FOSSACS
2004
Springer
16 years 29 days ago
Choice in Dynamic Linking
We introduce a computational interpretation for Hilbert’s choice operator (ε). This interpretation yields a typed foundation for dynamic linking in software systems. The use of ...
Martín Abadi, Georges Gonthier, Benjamin We...