Sciweavers

81 search results - page 4 / 17
» Exploring the search space of quantum programs
Sort
View
ICES
2010
Springer
148views Hardware» more  ICES 2010»
13 years 5 months ago
An Efficient Selection Strategy for Digital Circuit Evolution
In this paper, we propose a new modification of Cartesian Genetic Programming (CGP) that enables to optimize digital circuits more significantly than standard CGP. We argue that co...
Zbysek Gajda, Lukás Sekanina
SIGSOFT
2009
ACM
14 years 8 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
13 years 9 months ago
Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions
We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithreaded programs. The main idea is to use a lockset base...
Chao Wang, Yu Yang, Aarti Gupta, Ganesh Gopalakris...
ENTER
2010
Springer
14 years 2 months ago
Assessing the Dynamics of Search Results in Google
Search engine marketing requires a substantive understanding of the dynamics of the search system in the travel information search context. The goal of this study is to explore th...
Bing Pan, Zheng Xiang, Heather Tierney, Daniel R. ...
GI
2009
Springer
13 years 5 months ago
Towards a Parallel Search for Solutions of Non-deterministic Computations
: In this paper we explore the possibilities to perform the search for results of non-deterministic computations in parallel. We present three different approaches to this problem:...
Fabian Reck, Sebastian Fischer