Sciweavers

3913 search results - page 205 / 783
» complexity 2006
Sort
View
LICS
2006
IEEE
15 years 10 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
QEST
2006
IEEE
15 years 10 months ago
Bound-Preserving Composition for Markov Reward Models
Stochastic orders can be applied to Markov reward models and used to aggregate models, while introducing a bounded error. Aggregation reduces the number of states in a model, miti...
David Daly, Peter Buchholz, William H. Sanders
VTC
2006
IEEE
106views Communications» more  VTC 2006»
15 years 10 months ago
A Distributed Routing Approach for Vehicle Routing in Logistic Networks
Abstract— The increasing complexity and dynamics of logistic processes is creating significant new challenges for the management of goods transport. This is leading to increased...
Bernd-Ludwig Wenning, Andreas Timm-Giel, Dirk Pesc...
123
Voted
SAC
2006
ACM
15 years 10 months ago
Pseudozero set of interval polynomials
Interval polynomials are useful to describe perturbed polynomials. We present a graphical tool to describe how perturbations of the polynomial coefficients affect its zeros witho...
Stef Graillat, Philippe Langlois
ASIACRYPT
2006
Springer
15 years 8 months ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...