Sciweavers

2877 search results - page 108 / 576
» The Complexity of Planarity Testing
Sort
View
110
Voted
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
15 years 8 months ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...
CORR
1998
Springer
135views Education» more  CORR 1998»
15 years 3 months ago
The Computational Complexity of Probabilistic Planning
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
ASIACRYPT
2010
Springer
15 years 1 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
123
Voted
ICSE
1999
IEEE-ACM
15 years 8 months ago
Using a Goal-Driven Approach to Generate Test Cases for GUIs
The widespread use of GUIs for interacting with software is leading to the construction of more and more complex GUIs. With the growing complexity comes challenges in testing the ...
Atif M. Memon, Martha E. Pollack, Mary Lou Soffa
CHI
2002
ACM
16 years 4 months ago
A visual language for sketching large and complex interactive designs
Informal, sketch-based design tools closely match the work practices of user interface designers. Current tools, however, are limited in the size and complexity of interaction tha...
James Lin, Michael Thomsen, James A. Landay