Sciweavers

1431 search results - page 159 / 287
» The complexity of random ordered structures
Sort
View
ISCI
2008
117views more  ISCI 2008»
15 years 3 months ago
Search based software testing of object-oriented containers
Automatic software testing tools are still far from ideal for real world object-oriented (OO) software. The use of nature inspired search algorithms for this problem has been inve...
Andrea Arcuri, Xin Yao
147
Voted
DKE
2002
137views more  DKE 2002»
15 years 3 months ago
Reasoning for Web document associations and its applications in site map construction
Recently, there is an interest in using associations between web pages in providing users with pages relevant to what they are currently viewing. We believe that, to enable intell...
K. Selçuk Candan, Wen-Syan Li
132
Voted
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 9 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
ECCC
2010
83views more  ECCC 2010»
15 years 22 days ago
Symmetric LDPC codes are not necessarily locally testable
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...
ISCA
2005
IEEE
144views Hardware» more  ISCA 2005»
15 years 9 months ago
Scalable Load and Store Processing in Latency Tolerant Processors
Memory latency tolerant architectures support thousands of in-flight instructions without scaling cyclecritical processor resources, and thousands of useful instructions can compl...
Amit Gandhi, Haitham Akkary, Ravi Rajwar, Srikanth...