Sciweavers

3495 search results - page 608 / 699
» On the random satisfiable process
Sort
View
ISSTA
1993
ACM
15 years 10 months ago
Faults on Its Sleeve: Amplifying Software Reliability Testing
Most of the effort that goes into improving the quality of software paradoxically does not lead to quantitative, measurable quality. Software developers and quality-assurance orga...
Richard G. Hamlet, Jeffrey M. Voas
SMA
1993
ACM
107views Solid Modeling» more  SMA 1993»
15 years 10 months ago
Relaxed parametric design with probabilistic constraints
: Parametric design is an important modeling paradigm in computer aided design. Relationships (constraints) between the degrees of freedom (DOFs) of the model, instead of the DOFs ...
Yacov Hel-Or, Ari Rappoport, Michael Werman
SPAA
1994
ACM
15 years 10 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
ACAL
2009
Springer
15 years 10 months ago
An Empirical Exploration of a Definition of Creative Novelty for Generative Art
Abstract. We explore a new definition of creativity -- one which emphasizes the statistical capacity of a system to generate previously unseen patterns -- and discuss motivations f...
Taras Kowaliw, Alan Dorin, Jon McCormack
ACIVS
2007
Springer
15 years 10 months ago
Joint Domain-Range Modeling of Dynamic Scenes with Adaptive Kernel Bandwidth
Abstract. The first step in various computer vision applications is a detection of moving objects. The prevalent pixel-wise models regard image pixels as independent random process...
Borislav Antic, Vladimir S. Crnojevic