Sciweavers

1158 search results - page 143 / 232
» Software is discrete mathematics
Sort
View
AI
2010
Springer
15 years 26 days ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
117
Voted
MOC
2010
14 years 7 months ago
The number field sieve for integers of low weight
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
Oliver Schirokauer
BMCBI
2007
103views more  BMCBI 2007»
15 years 25 days ago
Dynamic simulation of regulatory networks using SQUAD
Background: The ambition of most molecular biologists is the understanding of the intricate network of molecular interactions that control biological systems. As scientists uncove...
Alessandro Di Cara, Abhishek Garg, Giovanni De Mic...
SIGSOFT
2007
ACM
16 years 1 months ago
Towards incremental adaptive covering arrays
The increasing complexity of configurable software systems creates a need for more intelligent sampling mechanisms to detect and locate failure-inducing dependencies between confi...
Adam A. Porter, Myra B. Cohen, Sandro Fouché...
125
Voted
ICSEA
2007
IEEE
15 years 7 months ago
A Novel Framework for Test Domain Reduction using Extended Finite State Machine
Test case generation is an expensive, tedious, and errorprone process in software testing. In this paper, test case generation is accomplished using an Extended Finite State Machi...
Nutchakorn Ngamsaowaros, Peraphon Sophatsathit