The following pages link to Pallab Dasgupta (Q230078):
Displaying 20 items.
- Agreement under faulty interfaces (Q293206) (← links)
- Formal assessment of reliability specifications in embedded cyber-physical systems (Q334152) (← links)
- Agent search in uniform b-ary trees: Multiple goals and unequal costs (Q671265) (← links)
- Agent searching in a tree and the optimality of iterative deepening (Q1341670) (← links)
- Utility of pathmax in partial order heuristic search (Q1352123) (← links)
- A branching time temporal framework for quantitative reasoning (Q1810854) (← links)
- Min-max event-triggered computation tree logic (Q1847543) (← links)
- A correction to: ``Agent searching in a tree and the optimality of iterative deepening'' (Q1855235) (← links)
- A fuzzy real-time temporal logic (Q2353964) (← links)
- The power of first-order quantification over states in branching and linear time temporal logics (Q2390310) (← links)
- Searching game trees under a partial order (Q2674204) (← links)
- Concurrent Usage Control Implementation Verification Using the SPIN Model Checker (Q3164601) (← links)
- Can Semi-Formal be Made More Formal? (Q3564033) (← links)
- Scheduling of Controllers’ Update-Rates for Residual Bandwidth Utilization (Q4603561) (← links)
- Multiobjective Heuristic Search in AND/OR Graphs (Q4876695) (← links)
- (Q4933704) (← links)
- Learning Temporal Causal Sequence Relationships from Real-Time Time-Series (Q5145839) (← links)
- Distributed Computing - IWDC 2004 (Q5465889) (← links)
- Heuristic search strategies for multiobjective state space search (Q5955789) (← links)
- Learn from your faults: leakage assessment in fault attacks using deep learning (Q6110383) (← links)
