213 search results - page 5 / 43 » The randomized complexity of initial value problems |
AAAI
1994
15 years 29 days ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
79
Voted
COCO
1991
Springer
15 years 3 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
SPAA
2010
ACM
14 years 12 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
79
Voted
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values...
120
Voted
CIA
2007
Springer
15 years 5 months ago
2007
Springer
Trust learning is a crucial aspect of information exchange, negotiation, and any other kind of social interaction among autonomous agents in open systems. But most current probabil...