Sciweavers

2446 search results - page 74 / 490
» Where am I
Sort
View
CORR
2011
Springer
180views Education» more  CORR 2011»
13 years 1 months ago
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
Lisa Fleischer, Zhenghui Wang
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
14 years 2 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
COMPGEOM
1994
ACM
14 years 2 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
BMCBI
2008
114views more  BMCBI 2008»
13 years 10 months ago
Testing the Coulomb/Accessible Surface Area solvent model for protein stability, ligand binding, and protein design
Background: Protein structure prediction and computational protein design require efficient yet sufficiently accurate descriptions of aqueous solvent. We continue to evaluate the ...
Marcel Schmidt am Busch, Anne Lopes, Najette Amara...
MANSCI
2008
119views more  MANSCI 2008»
13 years 10 months ago
Service-Level Differentiation in Call Centers with Fully Flexible Servers
We study large-scale service systems with multiple customer classes and many statistically identical servers. The following question is addressed: How many servers are required (s...
Itay Gurvich, Mor Armony, Avishai Mandelbaum