Sciweavers

16626 search results - page 2951 / 3326
» Computing is a natural science
Sort
View
DAM
1998
88views more  DAM 1998»
15 years 7 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
EC
1998
178views ECommerce» more  EC 1998»
15 years 7 months ago
The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
Michael D. Vose, Alden H. Wright
JBI
2002
128views Bioinformatics» more  JBI 2002»
15 years 7 months ago
Rutabaga by any other name: extracting biological names
i As the pace of biological research accelerates, biologists are becoming increasingly reliant on computers to manage the information explosion. Biologists communicate their resea...
Lynette Hirschman, Alexander A. Morgan, Alexander ...
JGAA
2002
99views more  JGAA 2002»
15 years 7 months ago
Graph Layout Aesthetics in UML Diagrams: User Preferences
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
Helen C. Purchase, Jo-Anne Allder, David A. Carrin...
CORR
1999
Springer
124views Education» more  CORR 1999»
15 years 7 months ago
An Algebraic Programming Style for Numerical Software and its Optimization
The abstract mathematical theory of partial differential equations (PDEs) is formulated in terms of manifolds,scalar fields, tensors, and the like, but these algebraic structures a...
T. B. Dinesh, Magne Haveraaen, Jan Heering
« Prev « First page 2951 / 3326 Last » Next »