Sciweavers

1802 search results - page 148 / 361
» Complexity Theory for Operators in Analysis
Sort
View
AUTOMATICA
2002
126views more  AUTOMATICA 2002»
15 years 6 months ago
Halo orbit mission correction maneuvers using optimal control
This paper addresses the computation of the required trajectory correction maneuvers (TCM) for a halo orbit space mission to compensate for the launch velocity errors introduced b...
Radu Serban, Wang Sang Koon, Martin W. Lo, Jerrold...
CCS
2005
ACM
15 years 12 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
KER
2008
193views more  KER 2008»
15 years 6 months ago
The 1st international workshop on computational social choice
Computational social choice is a new discipline currently emerging at the interface of social choice theory and computer science. It is concerned with the application of computati...
Ulle Endriss
PLDI
2010
ACM
15 years 11 months ago
Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
Matthew Might, Yannis Smaragdakis, David Van Horn
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
16 years 16 days ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...