352 search results - page 37 / 71 » On the optimal reachability problem of weighted timed automa... |
78
Voted
FORMATS
2005
Springer
15 years 6 months ago
2005
Springer
We consider real-time games where the goal consists, for each player, in maximizing the average amount of reward he or she receives per time unit. We consider zero-sum rewards, so ...
151
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
89
Voted
ICDM
2007
IEEE
15 years 6 months ago
2007
IEEE
Recommender systems based on collaborative filtering predict user preferences for products or services by learning past user-item relationships. A predominant approach to collabo...
113
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
115
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
This paper presents an study about a new Hybrid method GRASPES - for time series prediction, inspired in F. Takens theorem and based on a multi-start metaheuristic for combinatori...