Sciweavers

1354 search results - page 195 / 271
» Generalized real analysis and its applications
Sort
View
POPL
2007
ACM
15 years 10 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 7 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
ATAL
2003
Springer
15 years 1 months ago
Agent memory and adaptation in multi-agent systems
We describe a general mechanism for adaptation in multiagent systems in which agents modify their behavior based on their memory of past events. These behavior changes can be elic...
Kristina Lerman, Aram Galstyan
BMCBI
2004
75views more  BMCBI 2004»
14 years 9 months ago
Structural characterization of genomes by large scale sequence-structure threading
Background: Using sequence-structure threading we have conducted structural characterization of complete proteomes of 37 archaeal, bacterial and eukaryotic organisms (including wo...
Artem Cherkasov, Steven J. M. Jones
ISSTA
2009
ACM
15 years 4 months ago
HAMPI: a solver for string constraints
Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. Th...
Adam Kiezun, Vijay Ganesh, Philip J. Guo, Pieter H...