3356 search results - page 613 / 672 » Determining Consensus Numbers |
SAC
2000
ACM
14 years 1 days ago
2000
ACM
The global scenario put together by communication networks determines new opportunities towards the realization of Internetbased distributed services in many complex and composite...
ALT
2000
Springer
14 years 1 days ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
COCO
2000
Springer
14 years 22 hour ago
2000
Springer
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
CP
2000
Springer
14 years 21 hour ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
STOC
2010
ACM
14 years 9 hour ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...