Sciweavers

154 search results - page 20 / 31
» Using Proofs by Coinduction to Find
Sort
View
GECCO
2000
Springer
158views Optimization» more  GECCO 2000»
13 years 11 months ago
Grammar based function definition in Grammatical Evolution
We describe the use of grammars as an approach to automatic function definition in Grammatical Evolution. The automatic generation of functions allows the evolution of both the fu...
Michael O'Neill, Conor Ryan
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 8 months ago
Nonuniform Sparse Recovery with Gaussian Matrices
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
Ulas Ayaz, Holger Rauhut
JCC
2006
57views more  JCC 2006»
13 years 7 months ago
A search algorithm for fixed-composition protein design
: We present a computational protein design algorithm for finding low-energy sequences of fixed amino acid composition. The search algorithms used in protein design typically do no...
Geoffrey K. Hom, Stephen L. Mayo
ICTAC
2010
Springer
13 years 6 months ago
Formal Modelling of Separation Kernel Components
Abstract. Separation kernels are key components in embedded applications. Their small size and widespread use in high-integrity environments make them good targets for formal model...
Andrius Velykis, Leo Freitas
CSCW
2008
ACM
13 years 9 months ago
Can markets help?: applying market mechanisms to improve synchronous communication
There is a growing interest in applying market mechanisms to tackle everyday communication problems such as communication interruptions and communication overload. Prior analytic ...
Gary Hsieh, Robert Kraut, Scott E. Hudson, Roberto...