Sciweavers

19174 search results - page 3626 / 3835
» Computer Animation Techniques
Sort
View
IJCM
2002
97views more  IJCM 2002»
15 years 4 months ago
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
Richard Bean, Diane Donovan, Abdollah Khodkar, Ann...
AMAI
1999
Springer
15 years 4 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
166
Voted
JACM
2002
163views more  JACM 2002»
15 years 4 months ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...
INFORMS
1998
150views more  INFORMS 1998»
15 years 4 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
JMLR
2002
137views more  JMLR 2002»
15 years 4 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller
« Prev « First page 3626 / 3835 Last » Next »