Sciweavers

13457 search results - page 127 / 2692
» Can we elect if we cannot compare
Sort
View
ACRI
2004
Springer
14 years 25 days ago
Characterizing Configuration Spaces of Simple Threshold Cellular Automata
We study herewith the simple threshold cellular automata (CA), as perhaps the simplest broad class of CA with non-additive (i.e., non-linear and non-affine) local update rules. We ...
Predrag T. Tosic, Gul Agha
DLOG
2007
13 years 11 months ago
Expressing DL-Lite Ontologies with Controlled English
In this paper we deal with the problem of providing natural language front-ends to databases upon which an ontology layer has been added. Specifically, we are interested in expres...
Raffaella Bernardi, Diego Calvanese, Camilo Thorne
ICML
2002
IEEE
14 years 10 months ago
Reinforcement Learning and Shaping: Encouraging Intended Behaviors
We explore dynamic shaping to integrate our prior beliefs of the final policy into a conventional reinforcement learning system. Shaping provides a positive or negative artificial...
Adam Laud, Gerald DeJong
CVPR
2010
IEEE
14 years 5 months ago
Warping Background Subtraction
We present a background model that differentiates between background motion and foreground objects. Unlike most models that represent the variability of pixel intensity at a partic...
Teresa Ko, Stefano Soatto, Deborah Estrin
ESEM
2007
ACM
14 years 29 days ago
A Replicate Empirical Comparison between Pair Development and Software Development with Inspection
In 2005, we studied the development effort and effect of quality comparisons between software development with Fagan's inspection and pair development. Three experiments were...
Monvorath Phongpaibul, Barry W. Boehm