Sciweavers

507 search results - page 58 / 102
» A tabu search algorithm for structural software testing
Sort
View
MOBICOM
2010
ACM
13 years 8 months ago
SMS-based web search for low-end mobile devices
Short Messaging Service (SMS) based mobile information services have become increasingly common around the world, especially in emerging regions among users with low-end mobile de...
Jay Chen, Lakshminarayanan Subramanian, Eric A. Br...
SIGSOFT
2009
ACM
14 years 2 months ago
MSeqGen: object-oriented unit-test generation via mining source code
An objective of unit testing is to achieve high structural coverage of the code under test. Achieving high structural coverage of object-oriented code requires desirable method-ca...
Suresh Thummalapenta, Tao Xie, Nikolai Tillmann, J...
BMCBI
2007
144views more  BMCBI 2007»
13 years 7 months ago
Accelerated search for biomolecular network models to interpret high-throughput experimental data
Background: The functions of human cells are carried out by biomolecular networks, which include proteins, genes, and regulatory sites within DNA that encode and control protein e...
Suman Datta, Bahrad A. Sokhansanj
CSC
2008
13 years 9 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Qi Yang, Jamie McPeek, Adam Nofsinger
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 8 months ago
A parallel evolutionary algorithm for unconstrained binary quadratic problems
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
István Borgulya