Sciweavers

661 search results - page 79 / 133
» What Can We Expect from Program Verification
Sort
View
ICML
2003
IEEE
14 years 9 months ago
Unsupervised Learning with Permuted Data
We consider the problem of unsupervised learning from a matrix of data vectors where in each row the observed values are randomly permuted in an unknown fashion. Such problems ari...
Sergey Kirshner, Sridevi Parise, Padhraic Smyth
COMPUTER
2006
84views more  COMPUTER 2006»
13 years 8 months ago
Testable, Reusable Units of Cognition
The educational content of a technical topic consists, ultimately, of elementary chunks of knowledge. Identifying and classifying such units -- Testable, Reusable Units of Cogniti...
Bertrand Meyer
HICSS
2002
IEEE
95views Biometrics» more  HICSS 2002»
14 years 1 months ago
Simulation Spectrum and Stability Models
In this paper, we define a continuum of modeling styles, ranging from collections of very simple agents on one end to collections of very complex agents at the other end, and a s...
Christopher Landauer
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
14 years 3 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon
LCPC
1999
Springer
14 years 1 months ago
An Empirical Study of Function Pointers Using SPEC Benchmarks
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
Ben-Chung Cheng, Wen-mei W. Hwu