2214 search results - page 123 / 443 » Complexity of Reasoning |
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without maki...
128
click to vote
AAAI
2007
15 years 5 months ago
2007
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
100
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
139
Voted
SIGGRAPH
1990
ACM
15 years 7 months ago
1990
ACM
We describe a fast method for creating physically based animation of non-rigid objects. Rapid simulation of nonrigid behavior is based on global deformations. Constraints are used...
123
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...