Sciweavers

417 search results - page 67 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
SIGOPS
2008
141views more  SIGOPS 2008»
13 years 9 months ago
Using model checkers in an introductory course on operating systems
During the last three years, we have been experimenting with the use of the Uppaal model checker in an introductory course on operating systems for first-year Computer Science stu...
Roelof Hamberg, Frits W. Vaandrager
AES
2005
Springer
105views Cryptology» more  AES 2005»
13 years 9 months ago
TH-collocation for the biharmonic equation
This paper is intended as a contribution to enhance orthogonal collocation methods. In this, a novel collocation method--TH-collocation--is applied to the biharmonic equation and ...
Martín Díaz, Ismael Herrera
AICOM
2002
103views more  AICOM 2002»
13 years 8 months ago
The emergent computational potential of evolving artificial living systems
The computational potential of artificial living systems can be studied without knowing the algorithms that govern their behavior. Modeling single organisms by means of socalled c...
Jirí Wiedermann, Jan van Leeuwen
PPDP
2010
Springer
13 years 7 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
ICDT
2012
ACM
247views Database» more  ICDT 2012»
11 years 11 months ago
A normal form for preventing redundant tuples in relational databases
We introduce a new normal form, called essential tuple normal form (ETNF), for relations in a relational database where the constraints are given by functional dependencies and jo...
Hugh Darwen, C. J. Date, Ronald Fagin