Sciweavers

10594 search results - page 1739 / 2119
» Learning classifier systems
Sort
View
DT
2000
88views more  DT 2000»
15 years 6 months ago
Postsilicon Validation Methodology for Microprocessors
f abstraction as applicable to break the problem's complexity, and innovating better techniques to address complexity of new microarchitectural features. Validation techniques...
Hemant G. Rotithor
GPEM
2000
80views more  GPEM 2000»
15 years 6 months ago
Explanatory Analysis of the Metabolome Using Genetic Programming of Simple, Interpretable Rules
Genetic programming, in conjunction with advanced analytical instruments, is a novel tool for the investigation of complex biological systems at the whole-tissue level. In this stu...
Helen E. Johnson, Richard J. Gilbert, Michael K. W...
IJAC
2002
128views more  IJAC 2002»
15 years 6 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki
CN
1999
242views more  CN 1999»
15 years 6 months ago
Focused Crawling: A New Approach to Topic-Specific Web Resource Discovery
The rapid growth of the World-Wide Web poses unprecedented scaling challenges for general-purpose crawlers and search engines. In this paper we describe a new hypertext resource d...
Soumen Chakrabarti, Martin van den Berg, Byron Dom
PC
2002
114views Management» more  PC 2002»
15 years 6 months ago
Optimizing noncontiguous accesses in MPI-IO
The I/O access patterns of many parallel applications consist of accesses to a large number of small, noncontiguous pieces of data. If an application's I/O needs are met by m...
Rajeev Thakur, William Gropp, Ewing L. Lusk
« Prev « First page 1739 / 2119 Last » Next »