Sciweavers

1802 search results - page 158 / 361
» Complexity Theory for Operators in Analysis
Sort
View
SRDS
2006
IEEE
16 years 13 days ago
Experimental Comparison of Local and Shared Coin Randomized Consensus Protocols
The paper presents a comparative performance study of the two main classes of randomized binary consensus protocols: a local coin protocol, with an expected high communication com...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
VLDB
1998
ACM
138views Database» more  VLDB 1998»
15 years 10 months ago
TOPAZ: a Cost-Based, Rule-Driven, Multi-Phase Parallelizer
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
Clara Nippl, Bernhard Mitschang
CHI
2006
ACM
16 years 6 months ago
"Sketching" nurturing creativity: commonalities in art, design, engineering and research
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
Kumiyo Nakakoji, Atau Tanaka, Daniel Fallman
MOBIHOC
2007
ACM
16 years 6 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
GECCO
2007
Springer
136views Optimization» more  GECCO 2007»
16 years 18 days ago
Do additional objectives make a problem harder?
In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experime...
Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus...