Sciweavers

165 search results - page 13 / 33
» Estimating the Computational Cost of Logic Programs
Sort
View
PODS
2000
ACM
146views Database» more  PODS 2000»
13 years 12 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
DAC
2009
ACM
14 years 7 days ago
GRIP: scalable 3D global routing using integer programming
We propose GRIP, a scalable global routing technique via Integer Programming (IP). GRIP optimizes wirelength and via cost without going through a layer assignment phase. GRIP sele...
Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth
BROADNETS
2005
IEEE
14 years 1 months ago
Network selection using fuzzy logic
—The peer-to-peer technology offers many advantages, but at the same time, it poses many novel challenges for the research community. Modern peer-to-peer systems are characterize...
Shubha Kher, Arun K. Somani, Rohit Gupta
IOR
2007
106views more  IOR 2007»
13 years 7 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
JSW
2008
220views more  JSW 2008»
13 years 7 months ago
Empirical validation of Software development effort multipliers of Intermediate COCOMO Model
Intermediate COCOMO Model computes effort as a function of program size and a set of cost drivers. Effort adjustment factor (EAF) is calculated using 15 cost drivers. EAF is an imp...
M. J. Basavaraj, K. C. Shet