Sciweavers

358 search results - page 27 / 72
» Report on Generic Case Complexity
Sort
View
VLDB
1995
ACM
129views Database» more  VLDB 1995»
15 years 3 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...
AIIA
1991
Springer
15 years 3 months ago
Approximate Entailment
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
Marco Cadoli, Marco Schaerf
SPLC
2008
15 years 1 months ago
Automated Domain-Specific Modeling Languages for Generating Framework-Based Applications
The adoption of Domain-Specific Modeling Languages (DSMLs) for generating framework-based applications has proved to be an effective way of enforcing the correct use of frameworks...
André L. Santos, Kai Koskimies, Antó...
CORR
2006
Springer
112views Education» more  CORR 2006»
14 years 11 months ago
High-level synthesis under I/O Timing and Memory constraints
The design of complex Systems-on-Chips implies to take into account communication and memory access constraints for the integration of dedicated hardware accelerator. In this paper...
Philippe Coussy, Gwenolé Corre, Pierre Bome...
CONSTRAINTS
2007
93views more  CONSTRAINTS 2007»
14 years 11 months ago
Arc-B-consistency of the Inter-distance Constraint
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...
Konstantin Artiouchine, Philippe Baptiste