Sciweavers

1763 search results - page 302 / 353
» Dependent random choice
Sort
View
CASES
2003
ACM
15 years 5 months ago
Clustered calculation of worst-case execution times
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
Andreas Ermedahl, Friedhelm Stappert, Jakob Engblo...
GECCO
2003
Springer
133views Optimization» more  GECCO 2003»
15 years 5 months ago
Dynamic Strategies in a Real-Time Strategy Game
Abstract. Most modern real-time strategy computer games have a sophisticated but fixed ‘AI’ component that controls the computer’s actions. Once the user has learned how suc...
William Joseph Falke II, Peter Ross
ACISP
2001
Springer
15 years 4 months ago
Private Information Retrieval Based on the Subgroup Membership Problem
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
Akihiro Yamamura, Taiichi Saito
MICCAI
2001
Springer
15 years 4 months ago
Valmet: A New Validation Tool for Assessing and Improving 3D Object Segmentation
Extracting 3D structures from volumetric images like MRI or CT is becoming a routine process for diagnosis based on quantitation, for radiotherapy planning, for surgical planning a...
Guido Gerig, Matthieu Jomier, Miranda Chakos
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 4 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund