Sciweavers

5100 search results - page 875 / 1020
» The Linear Complexity of a Graph
Sort
View
SEAL
1998
Springer
15 years 9 months ago
Genetic Programming with Active Data Selection
Genetic programming evolves Lisp-like programs rather than fixed size linear strings. This representational power combined with generality makes genetic programming an interesting ...
Byoung-Tak Zhang, Dong-Yeon Cho
IPPS
1996
IEEE
15 years 9 months ago
Kiloprocessor Extensions to SCI
To expand the Scalable Coherent Interface's (SCI) capabilities so it can be used to efficiently handle sharing in systems of hundreds or even thousands of processors, the SCI...
Stefanos Kaxiras
138
Voted
ICLP
1997
Springer
15 years 9 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
DAC
1996
ACM
15 years 9 months ago
A Sparse Image Method for BEM Capacitance Extraction
Boundary element methods (BEM) are often used for complex 3-D capacitance extraction because of their efficiency, ease of data preparation, and automatic handling of open regions. ...
Byron Krauter, Yu Xia, E. Aykut Dengi, Lawrence T....
VLDB
1997
ACM
175views Database» more  VLDB 1997»
15 years 9 months ago
STING: A Statistical Information Grid Approach to Spatial Data Mining
Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of s...
Wei Wang 0010, Jiong Yang, Richard R. Muntz