Sciweavers

4940 search results - page 566 / 988
» On the Complexity of Universal Programs
Sort
View
217
Voted
KES
2008
Springer
15 years 6 months ago
Instruction-based development: From evolution to generic structures of digital circuits
Evolutionary techniques provide powerful tools to design novel solutions for hard problems in different areas. However, the problem of scale (i.e. how to create a large, complex s...
Michal Bidlo, Jaroslav Skarvada
JUCS
2006
107views more  JUCS 2006»
15 years 6 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
MP
2006
101views more  MP 2006»
15 years 6 months ago
Robust optimization of contaminant sensor placement for community water systems
We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We f...
Robert D. Carr, Harvey J. Greenberg, William E. Ha...
SPE
2002
141views more  SPE 2002»
15 years 6 months ago
Data collection and restoration for heterogeneous process migration
This study presents a practical solution for data collection and restoration to migrate a process written in high level stack-based languages such as C and Fortran over a network ...
Kasidit Chanchio, Xian-He Sun
JPDC
2010
117views more  JPDC 2010»
15 years 5 months ago
Extensible transactional memory testbed
Transactional Memory (TM) is a promising abstraction as it hides all synchronization complexities from the programmers of concurrent applications. More particularly the TM paradig...
Derin Harmanci, Vincent Gramoli, Pascal Felber, Ch...