Sciweavers

216 search results - page 20 / 44
» Covering Problems with Hard Capacities
Sort
View
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
14 years 1 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
FOCS
2006
IEEE
14 years 1 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
PODS
2008
ACM
221views Database» more  PODS 2008»
14 years 7 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
CMG
2001
13 years 9 months ago
Jump Start Your Performance Career Using Analytic Modeling
What is the career path for a performance analyst? A capacity planner? Most technicians paid their dues in the trenches of systems programming or operations. Having done it all, t...
Denise P. Kalm
WEBI
2004
Springer
14 years 27 days ago
Incentive-Compatible Social Choice
Many situations present a social choice problem where different self-interested agents have to agree on joint, coordinated decisions. For example, power companies have to agree o...
Boi Faltings