Sciweavers

162 search results - page 10 / 33
» Flow Logics for Constraint Based Analysis
Sort
View
ICLP
1997
Springer
13 years 11 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
BROADNETS
2004
IEEE
13 years 11 months ago
Decoupling Packet Loss from Blocking in Proactive Reservation-Based Switching
We consider the maximization of network throughput in buffer-constrained optical networks using aggregate bandwidth allocation and reservation-based transmission control. Assuming...
Mahmoud Elhaddad, Rami G. Melhem, Taieb Znati
CAIP
2009
Springer
110views Image Analysis» more  CAIP 2009»
14 years 3 days ago
Optic Flow Using Multi-scale Anchor Points
We introduce a new method to determine the flow field of an image sequence using multi-scale anchor points. These anchor points manifest themselves in the scale-space representat...
Pieter van Dorst, Bart Janssen, Luc Florack, Bart ...
CADE
2010
Springer
13 years 8 months ago
A Slice-Based Decision Procedure for Type-Based Partial Orders
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Elena Sherman, Brady J. Garvin, Matthew B. Dwyer
SIGCOMM
1991
ACM
13 years 11 months ago
A Control-Theoretic Approach to Flow Control
This paper presents a control-theoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a round-robin-like queue service discipline in the o...
Srinivasan Keshav