Sciweavers

999 search results - page 162 / 200
» On the Decidability of Functional Uncertainty
Sort
View
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
13 years 9 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
PAKM
2000
13 years 9 months ago
Knowledge Management and New Product Development: Learning from a Software Development Firm
The core of the new product development [NPD] process centers on knowledge creation, utilization and the management of knowledge. This manuscript uses a software firm case to esta...
Abraham B. Shani, James A. Sena
WCE
2007
13 years 8 months ago
Modelling BLUE Active Queue Management using Discrete-time Queue
—This paper proposes a new discrete-time queue analytical model based on BLUE algorithm in order to determine the network congestion in preliminary stages. We compare the origina...
Hussein Abdel-jaber, Michael E. Woodward, Fadi A. ...
CCGRID
2010
IEEE
13 years 8 months ago
Decentralized Resource Availability Prediction for a Desktop Grid
In a desktop grid model, the job (computational task) is submitted for execution in the resource only when the resource is idle. There is no guarantee that the job which has starte...
Karthick Ramachandran, Hanan Lutfiyya, Mark Perry
ECAI
2010
Springer
13 years 8 months ago
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
Sylvain Bouveret, Ulle Endriss, Jérôm...