Sciweavers

1477 search results - page 175 / 296
» Random Convex Programs
Sort
View
ECOOP
1987
Springer
14 years 16 days ago
Dynamic Grouping in an Object-Oriented Virtual Memory Hierarchy
Object oriented programming environments frequently suffer serious performance degradation because of a high level of paging activity when implemented using a conventional virtual...
Ifor Williams, Mario Wolczko, Trevor Hopkins
CASCON
1996
118views Education» more  CASCON 1996»
13 years 10 months ago
On predicting reliability of modules using code coverage
The estimation of reliability of modules using code coverage is motivated by a two-phase method for estimating the quality of software using static structure and predicted quality...
Saileshwar Krishnamurthy, Aditya P. Mathur
IOR
2006
173views more  IOR 2006»
13 years 9 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
TAP
2008
Springer
102views Hardware» more  TAP 2008»
13 years 9 months ago
Functional Testing in the Focal Environment
This article presents the generation and test case execution under the framework Focal. In the programming language Focal, all properties of the program are written within the sour...
Matthieu Carlier, Catherine Dubois
MOR
2000
162views more  MOR 2000»
13 years 8 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan