Sciweavers

1653 search results - page 229 / 331
» Computer science and game theory
Sort
View
FOCS
1998
IEEE
15 years 3 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
SIGCSE
2012
ACM
282views Education» more  SIGCSE 2012»
13 years 6 months ago
Understanding the tenets of agile software engineering: lecturing, exploration and critical thinking
The use of agile principles and practices in software development is becoming a powerful force in today’s workplace. In our quest to develop better products, therefore, it is im...
Shvetha Soundararajan, Amine Chigani, James D. Art...
CONCUR
2012
Springer
13 years 1 months ago
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
Guy Avni, Orna Kupferman
ISI
2010
Springer
14 years 9 months ago
Social media and social reality
Social Media provide an exciting and novel view into social phenomena. The vast amounts of data that can be gathered from the Internet coupled with massively parallel supercomputer...
William N. Reynolds, Marta S. Weber, Robert M. Far...
STACS
2010
Springer
15 years 6 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...