Sciweavers

583 search results - page 66 / 117
» Finding Answers to Complex Questions
Sort
View
CORR
2004
Springer
114views Education» more  CORR 2004»
13 years 10 months ago
Quantum Communication Cannot Simulate a Public Coin
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
ICDE
2001
IEEE
206views Database» more  ICDE 2001»
14 years 11 months ago
Cache-Aware Query Routing in a Cluster of Databases
We investigate query routing techniques in a cluster of databases for a query-dominant environment. The objective is to decrease query response time. Each component of the cluster...
Uwe Röhm, Klemens Böhm, Hans-Jörg S...
WG
2009
Springer
14 years 4 months ago
Distance d-Domination Games
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
Stephan Kreutzer, Sebastian Ordyniak
GECCO
2007
Springer
234views Optimization» more  GECCO 2007»
14 years 4 months ago
Applying particle swarm optimization to software testing
Evolutionary structural testing is an approach to automatically generating test cases that achieve high structural code coverage. It typically uses genetic algorithms (GAs) to sea...
Andreas Windisch, Stefan Wappler, Joachim Wegener
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
14 years 3 months ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...