Sciweavers

28888 search results - page 191 / 5778
» Computability and complexity in analysis
Sort
View
UML
2001
Springer
14 years 21 days ago
UML Modelling and Performance Analysis of Mobile Software Architectures
Modern distributed software applications generally operate in complex and heterogeneous computing environments (like the World Wide Web). Different paradigms (client-server, mobili...
Vincenzo Grassi, Raffaela Mirandola
SIAMCOMP
2000
106views more  SIAMCOMP 2000»
13 years 8 months ago
Computationally Sound Proofs
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
Silvio Micali
MP
2006
134views more  MP 2006»
13 years 8 months ago
Cubic regularization of Newton method and its global performance
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
Yurii Nesterov, Boris T. Polyak
SC
2000
ACM
14 years 19 days ago
A Tool Framework for Static and Dynamic Analysis of Object-Oriented Software with Templates
The developers of high-performance scientific applications often work in complex computing environments that place heavy demands on program analysis tools. The developers need to...
Kathleen A. Lindlan, Janice E. Cuny, Allen D. Malo...
SIGMOD
2003
ACM
147views Database» more  SIGMOD 2003»
14 years 8 months ago
Formal semantics and analysis of object queries
Modern database systems provide not only powerful data models but also complex query languages supporting powerful features such as the ability to create new database objects and ...
Gavin M. Bierman