Sciweavers

7092 search results - page 1291 / 1419
» Parallelizing constraint programs
Sort
View
OOPSLA
1995
Springer
13 years 11 months ago
Subtypes vs. Where Clauses: Constraining Parametric Polymorphism
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
Mark Day, Robert Gruber, Barbara Liskov, Andrew C....
SDB
1995
178views Database» more  SDB 1995»
13 years 11 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin
CLA
2007
13 years 9 months ago
An FDP-Algorithm for Drawing Lattices
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
Christian Zschalig
IJCAI
2007
13 years 9 months ago
Learning to Walk through Imitation
Programming a humanoid robot to walk is a challenging problem in robotics. Traditional approaches rely heavily on prior knowledge of the robot's physical parameters to devise...
Rawichote Chalodhorn, David B. Grimes, Keith Groch...
IJCAI
1997
13 years 9 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
« Prev « First page 1291 / 1419 Last » Next »