Sciweavers

6251 search results - page 381 / 1251
» Randomness, Computability, and Density
Sort
View
COR
2011
15 years 1 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic

Publication
179views
17 years 5 months ago
Characteristics of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes
The size of computer networks, along with their bandwidths, is growing exponentially. To support these large, high-speed networks, it is neccessary to be able to forward packets in...
R. Jain
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
16 years 6 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
ISPDC
2007
IEEE
16 years 1 months ago
Fully Distributed Active and Passive Task Management for Grid Computing
The task management is a key point in grid applications and can highly influence their efficiency. There are many solutions that we can classify according to their centralizatio...
Alain Bui, Olivier Flauzac, Cyril Rabat
ISQED
2005
IEEE
140views Hardware» more  ISQED 2005»
16 years 11 days ago
Toward Quality EDA Tools and Tool Flows Through High-Performance Computing
As the scale and complexity of VLSI circuits increase, Electronic Design Automation (EDA) tools become much more sophisticated and are held to increasing standards of quality. New...
Aaron N. Ng, Igor L. Markov