5606 search results - page 764 / 1122 » Randomization Techniques for Graphs. |
204
click to vote
CP
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
193
click to vote
FCT
2007
Springer
16 years 29 days ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
187
click to vote
IFL
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Refactoring is a technique for improving the design of existing programs without changing their behaviour. Wrangler is a tool built at the University of Kent to support E...
191
click to vote
ISSAC
2007
Springer
16 years 28 days ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
188
click to vote
SSS
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. In sensor networks, correct clocks have arbitrary starting offsets and nondeterministic fluctuating skews. We consider an adversary that aims at tampering with the cloc...