Sciweavers

62 search results - page 3 / 13
» The Ackermann Award 2005
Sort
View
ICALP
2005
Springer
13 years 11 months ago
Union-Find with Constant Time Deletions
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
Stephen Alstrup, Inge Li Gørtz, Theis Rauhe...
ICDCS
2005
IEEE
13 years 12 months ago
Referees
The NBA provides an intriguing place to assess discrimination: referees and players are involved in repeated interactions in a high-pressure setting with referees making the type ...
GECCO
2005
Springer
118views Optimization» more  GECCO 2005»
13 years 11 months ago
The Push3 execution stack and the evolution of control
The Push programming language was developed for use in genetic and evolutionary computation systems, as the representation within which evolving programs are expressed. It has bee...
Lee Spector, Jon Klein, Maarten Keijzer
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
13 years 11 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
14 years 6 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour