Sciweavers

450 search results - page 75 / 90
» Algorithmic uses of the Feferman-Vaught Theorem
Sort
View
ALT
2002
Springer
14 years 5 months ago
The Complexity of Learning Concept Classes with Polynomial General Dimension
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
Johannes Köbler, Wolfgang Lindner
WWW
2010
ACM
14 years 3 months ago
Debugging standard document formats
We present a tool for helping XML schema designers to obtain a high quality level for their specifications. The tool allows one to analyze relations between classes of XML docume...
Nabil Layaïda, Pierre Genevès
RTSS
2007
IEEE
14 years 2 months ago
Robust Priority Assignment for Fixed Priority Real-Time Systems
This paper focuses on priority assignment for realtime systems using fixed priority scheduling. It introduces and defines the concept of a “robust” priority ordering: the most...
Robert I. Davis, Alan Burns
ACL2
2006
ACM
14 years 2 months ago
Phylogenetic trees in ACL2
Biologists studying the evolutionary relationships between organisms use software packages to solve the computational problems they encounter. Several of these problems involve th...
Warren A. Hunt Jr., Serita M. Nelesen
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
14 years 2 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...