Sciweavers

2231 search results - page 189 / 447
» Alternation as a programming paradigm
Sort
View
JMLR
2012
13 years 7 months ago
Primal-Dual methods for sparse constrained matrix completion
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
Yu Xin, Tommi Jaakkola
POPL
1989
ACM
15 years 8 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott

Publication
258views
17 years 3 months ago
Breaking Robert's Rules
A consensus building alternative to group decision-making that any group, organization, firm or assembly can use instead of Robert's Rules of order or parliamentary procedure....
Lawrence Susskind, Jeffrey Cruikshank
DATE
2005
IEEE
129views Hardware» more  DATE 2005»
15 years 10 months ago
Hardware Support for Arbitrarily Complex Loop Structures in Embedded Applications
In this paper, the program control unit of an embedded RISC processor is enhanced with a novel zerooverhead loop controller (ZOLC) supporting arbitrary loop structures with multip...
Nikolaos Kavvadias, Spiridon Nikolaidis
FM
1999
Springer
88views Formal Methods» more  FM 1999»
15 years 9 months ago
Refinement Semantics and Loop Rules
Refinement semantics is an alternative to least fixpoint semantics that is more useful for programming. From it we derive a variety of rules for w h i l e-loops, for-loops, and loo...
Eric C. R. Hehner, Andrew M. Gravell