Sciweavers

7167 search results - page 1328 / 1434
» Answer Set Programming
Sort
View
COMPSAC
1997
IEEE
14 years 1 months ago
Classifying Architectural Elements as a Foundation for Mechanism Matching
Building a system at the architectural level can be thought of as decomposition into components followed by a series of exercises in matching. Components must be composed with eac...
Rick Kazman, Paul C. Clements, Leonard J. Bass, Gr...
DASFAA
2007
IEEE
165views Database» more  DASFAA 2007»
14 years 1 months ago
Making the Most of Cache Groups
Cache groups are a powerful concept for database caching, which is used to relieve the backend database load and to keep referenced data close to the application programs at the &q...
Andreas Bühmann, Theo Härder
CCGRID
2001
IEEE
14 years 23 days ago
An Adaptive, Reconfigurable Interconnect for Computational Clusters
This paper describes the principles of an original adaptive interconnect for a computational cluster. Torus topology (2d or 3d) is used as a basis but nodes are allowed to effecti...
Alexander V. Shafarenko, Vladimir Vasekin
KDD
2000
ACM
129views Data Mining» more  KDD 2000»
14 years 21 days ago
Evolutionary algorithms in data mining: multi-objective performance modeling for direct marketing
Predictive models in direct marketing seek to identify individuals most likely to respond to promotional solicitations or other intervention programs. While standard modeling appr...
Siddhartha Bhattacharyya
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 11 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
« Prev « First page 1328 / 1434 Last » Next »