Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CP
2008
Springer
11 years 11 months ago
Dichotomic Search Protocols for Constrained Optimization
Abstract. We devise a theoretical model for dichotomic search algorithms for constrained optimization. We show that, within our model, a certain way of choosing the breaking point ...
Meinolf Sellmann, Serdar Kadioglu
PAM
2010
Springer
11 years 11 months ago
OpenTM: Traffic Matrix Estimator for OpenFlow Networks
Abstract. In this paper we present OpenTM, a traffic matrix estimation system for OpenFlow networks. OpenTM uses built-in features provided in OpenFlow switches to directly and acc...
Amin Tootoonchian, Monia Ghobadi, Yashar Ganjali
ISAAC
2000
Springer
100views Algorithms» more  ISAAC 2000»
12 years 1 months ago
An Improved Algorithm for Subdivision Traversal without Extra Storage
We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant...
Prosenjit Bose, Pat Morin
ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
12 years 1 months ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres
MFCS
1993
Springer
12 years 1 months ago
The Complexity of Finding Replicas Using Equality Tests
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, S...
INFOCOM
1993
IEEE
12 years 1 months ago
Queueing Delays in Rate Controlled ATM Networks
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
Anindo Banerjea, Srinivasan Keshav
STACS
1997
Springer
12 years 1 months ago
Predecessor Queries in Dynamic Integer Sets
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
Gerth Stølting Brodal
ASP
2001
Springer
12 years 2 months ago
Computing stable models in parallel
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
Raphael A. Finkel, Victor W. Marek, Neil Moore, Mi...
ISSRE
2002
IEEE
12 years 2 months ago
Worst Case Reliability Prediction Based on a Prior Estimate of Residual Defects
In this paper we extend an earlier worst case bound reliability theory to derive a worst case reliability function R(t), which gives the worst case probability of surviving a furt...
Peter G. Bishop, Robin E. Bloomfield
COMPGEOM
2004
ACM
12 years 3 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...
books