Sciweavers

612 search results - page 41 / 123
» Bounded model checking for knowledge and real time
Sort
View
EWCBR
2008
Springer
14 years 11 months ago
Situation Assessment for Plan Retrieval in Real-Time Strategy Games
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
Kinshuk Mishra, Santiago Ontañón, As...
ICALP
1994
Springer
15 years 1 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
ASIAN
2009
Springer
334views Algorithms» more  ASIAN 2009»
14 years 10 months ago
A Dolev-Yao Model for Zero Knowledge
In cryptographic protocols, zero knowledge proofs are employed for a principal A to communicate some non-trivial information t to B while at the same time ensuring that B cannot de...
Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh
RT
2001
Springer
15 years 2 months ago
Point-Based Impostors for Real-Time Visualization
Abstract. We present a new data structure for encoding the appearance of a geometric model as seen from a viewing region (view cell). This representation can be used in interactive...
Michael Wimmer, Peter Wonka, François X. Si...
JEC
2006
113views more  JEC 2006»
14 years 9 months ago
CyNC: A method for real time analysis of systems with cyclic data flows
The paper addresses a novel method for realtime analysis of systems with cyclic data flows. The presented method is based on Network Calculus principles, where upper and lower flo...
Henrik Schiøler, Jens Dalsgaard Nielsen, Ki...