Sciweavers

1142 search results - page 172 / 229
» Approximability of Clausal Constraints
Sort
View
JOIN
2007
91views more  JOIN 2007»
15 years 6 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
15 years 6 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
TON
1998
90views more  TON 1998»
15 years 6 months ago
Effective bandwidths with priorities
—The notion of effective bandwidths has provided a useful practical framework for connection admission control and capacity planning in high-speed communication networks. The ass...
Arthur W. Berger, Ward Whitt
POPL
2011
ACM
14 years 9 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...
CVPR
2009
IEEE
17 years 1 months ago
Automated Feature Extraction for Early Detection of Diabetic Retinopathy in Fundus Images
Automated detection of lesions in retinal images can assist in early diagnosis and screening of a common disease: Diabetic Retinopathy. A robust and computationally efficient ap...
Saiprasad Ravishankar (University of Illinois Urba...