Sciweavers

4903 search results - page 604 / 981
» The Set Covering Machine
Sort
View
ICML
2002
IEEE
16 years 7 months ago
Action Refinement in Reinforcement Learning by Probability Smoothing
In many reinforcement learning applications, the set of possible actions can be partitioned by the programmer into subsets of similar actions. This paper presents a technique for ...
Carles Sierra, Dídac Busquets, Ramon L&oacu...
WWW
2006
ACM
16 years 7 months ago
Dynamic placement for clustered web applications
We introduce and evaluate a middleware clustering technology capable of allocating resources to web applications through dynamic application instance placement. We define applicat...
A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike S...
KDD
2007
ACM
149views Data Mining» more  KDD 2007»
16 years 7 months ago
Partial example acquisition in cost-sensitive learning
It is often expensive to acquire data in real-world data mining applications. Most previous data mining and machine learning research, however, assumes that a fixed set of trainin...
Victor S. Sheng, Charles X. Ling
POPL
2006
ACM
16 years 7 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
ICWS
2009
IEEE
16 years 4 months ago
A Tool for Choreography Analysis Using Collaboration Diagrams
Analyzing interactions among peers that interact via messages is a crucial problem due to increasingly distributed nature of current software systems, especially the ones built us...
Tevfik Bultan, Chris Ferguson, Xiang Fu