Sciweavers

8298 search results - page 156 / 1660
» On the Complexity of Numerical Analysis
Sort
View
ORL
2006
118views more  ORL 2006»
15 years 6 months ago
On complexity of multistage stochastic programs
In this paper we derive estimates of the sample sizes required to solve a multistage stochastic programming problem with a given accuracy by the (conditional sampling) sample aver...
Alexander Shapiro
FORMATS
2004
Springer
15 years 10 months ago
Some Progress in Satisfiability Checking for Difference Logic
Abstract. In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integra...
Scott Cotton, Eugene Asarin, Oded Maler, Peter Nie...
ISCAS
1995
IEEE
83views Hardware» more  ISCAS 1995»
15 years 10 months ago
Calculating Distortion Levels in Sampled-Data Circuits Using SPICE
This paper presents an analysis technique that can be used to compute the harmonic and intermodulation distortion levels of a sampled-data circuit directly from a SPICE transient ...
Gordon W. Roberts
CORR
2008
Springer
143views Education» more  CORR 2008»
15 years 6 months ago
On Reliability of Dynamic Addressing Routing Protocols in Mobile Ad Hoc Networks
In this paper, a reliability analysis is carried out to state a performance comparison between two recently proposed proactive routing algorithms. These protocols are able to scale...
Marcello Caleffi, Giancarlo Ferraiuolo, Luigi Paur...
COMPLEX
2009
Springer
15 years 10 months ago
A Comparative Analysis of Specific Spatial Network Topological Models
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
Jun Wang, Gregory M. Provan