Sciweavers

887 search results - page 34 / 178
» A Time for Choosing
Sort
View
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
14 years 1 months ago
Backward-chaining genetic programming
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Riccardo Poli, William B. Langdon
FOSSACS
2004
Springer
14 years 1 months ago
Reasoning about Dynamic Policies
People often need to reason about policy changes before they are adopted. For example, suppose a website manager knows that users want to enter her site without going through the w...
Riccardo Pucella, Vicky Weissman
COLT
2001
Springer
14 years 6 days ago
Tracking a Small Set of Experts by Mixing Past Posteriors
In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...
Olivier Bousquet, Manfred K. Warmuth
IJCAI
2003
13 years 9 months ago
Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...
Laurence A. Kramer, Stephen F. Smith
WSCG
2004
138views more  WSCG 2004»
13 years 9 months ago
Efficient Clothing Fitting from Data
A major drawback of shopping for clothes on-line is that the customer cannot try on clothes and see if they fit or suit them. One solution is to display clothing on an avatar, a 3...
Marco Gillies, Daniel Ballin, Balázs Csan&a...