Sciweavers

1995 search results - page 84 / 399
» What's the Problem
Sort
View
132
Voted
CHI
2003
ACM
16 years 4 months ago
The toilet entertainment system
A toilet is not only a place where people answer calls of nature. It is also a place for contemplation and reflection ? and a place where people read information. But bringing thi...
Johan Thoresson, Pär Stenberg
107
Voted
STOC
2005
ACM
104views Algorithms» more  STOC 2005»
16 years 4 months ago
Beyond NP: the work and legacy of Larry Stockmeyer
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...
Lance Fortnow
150
Voted
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 4 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
136
Voted
WCRE
2008
IEEE
15 years 10 months ago
Pitfalls in Aspect Mining
The research domain of aspect mining studies the problem of (semi-)automatically identifying potential aspects and crosscutting concerns in a software system, to improve the syste...
Kim Mens, Andy Kellens, Jens Krinke
123
Voted
WSC
1998
15 years 5 months ago
Simulation Case Studies in the Print/Finish Industry
Process simulation is a powerful analysis tool used in many industries. It allows companies to be proactive in determining what strategies will be successful. For this reason, man...
Tim Curran, D. Michelle Benjamin, Sue Austin