Sciweavers

1991 search results - page 280 / 399
» Small Models of Large Machines
Sort
View
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 4 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
ISSRE
2006
IEEE
15 years 4 months ago
Studying the Characteristics of a "Good" GUI Test Suite
The widespread deployment of graphical-user interfaces (GUIs) has increased the overall complexity of testing. A GUI test designer needs to perform the daunting task of adequately...
Qing Xie, Atif M. Memon
IR
2006
14 years 10 months ago
Evolving local and global weighting schemes in information retrieval
This paper describes a method, using Genetic Programming, to automatically determine term weighting schemes for the vector space model. Based on a set of queries and their human de...
Ronan Cummins, Colm O'Riordan
IJRR
2002
143views more  IJRR 2002»
14 years 9 months ago
Persistent Passive Hopping and Juggling is Possible Even With Plastic Collisions
We describe simple one-dimensional models of passive (no energy input, no control), generally dissipative, vertical hopping and oneball juggling. The central observation is that i...
Anindya Chatterjee, R. Pratap, C. K. Reddy, Andy R...
POPL
2007
ACM
15 years 10 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic