Sciweavers

1689 search results - page 67 / 338
» On Natural Non-dcpo Domains
Sort
View
CSCLP
2003
Springer
15 years 11 months ago
Implementing Propagators for Tabular Constraints
Many real-life constraints describing relations between the problem variables have complex semantics and the constraint domain is defined using a table of compatible tuples rather ...
Roman Barták, Roman Mecl
CL
2000
Springer
15 years 9 months ago
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
Tommi A. Junttila, Ilkka Niemelä
FLAIRS
2008
15 years 8 months ago
An Intelligent Tutoring Architecture for Simulation-Based Training
Truly generic and reusable intelligent tutoring software architectures have remained elusive. As part of our effort to develop tutoring systems for simulations of ill-defined doma...
Dave Gomboc, Mark G. Core, H. Chad Lane, Ashish Ka...
ACMSE
2008
ACM
15 years 8 months ago
A little language for surveys: constructing an internal DSL in Ruby
Using a problem domain motivated by Bentley's"Little Languages" column [1], this paper explores the use of the Ruby programming language's flexible syntax, dyn...
H. Conrad Cunningham
MVA
2007
114views Computer Vision» more  MVA 2007»
15 years 7 months ago
Sign Language Recognition Using Boosted Volumetric Features
This paper proposes a method for sign language recognition that bypasses the need for tracking by classifying the motion directly. The method uses the natural extension of haar li...
Helen Cooper, Richard Bowden