Sciweavers

604 search results - page 75 / 121
» On the Complexity of the Maximum Cut Problem
Sort
View
AIPS
2007
15 years 1 days ago
Bounding the Resource Availability of Activities with Linear Resource Impact
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
Jeremy Frank, Paul H. Morris
TON
2002
99views more  TON 2002»
14 years 9 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
DCC
2008
IEEE
15 years 9 months ago
An Estimation-Theoretic Interpretation of Video Rate Distortion Optimization with Lagrangian Formulation
Rate distortion optimization with Lagrangian formulation is widely used in video encoder control and has proved effective in achieving a good trade-off between coding efficiency a...
Zhen Li, Alexis Michael Tourapis
CCCG
2007
14 years 11 months ago
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
Arindam Karmakar, Sasanka Roy, Sandip Das
SAC
2008
ACM
14 years 9 months ago
PHALANX: a graph-theoretic framework for test case prioritization
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...
Murali Krishna Ramanathan, Mehmet Koyutürk, A...