35 search results - page 3 / 7 » Random Strings Make Hard Instances |
ISSTA
2010
ACM
13 years 9 months ago
2010
ACM
Testing object-oriented (OO) software is critical because OO languages are commonly used in developing modern software systems. In testing OO software, one important and yet chall...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— As content delivery to wireless devices becomes faster and scalable, it is likely that mobile commerce will constitute a significant portion of digital commerce. In markets, b...
TAINN
2005
Springer
14 years 1 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
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...
SSS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user anonymous authentication in distributed networks such as...