Sciweavers

377 search results - page 41 / 76
» A Value Theory of Meta-Learning Algorithms
Sort
View
WWW
2008
ACM
16 years 15 days ago
Matching independent global constraints for composite web services
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
Nalaka Gooneratne, Zahir Tari
SIGECOM
2005
ACM
169views ECommerce» more  SIGECOM 2005»
15 years 5 months ago
Online auctions with re-usable goods
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...
ICML
2005
IEEE
16 years 19 days ago
Combining model-based and instance-based learning for first order regression
T ORDER REGRESSION (EXTENDED ABSTRACT) Kurt Driessensa Saso Dzeroskib a Department of Computer Science, University of Waikato, Hamilton, New Zealand (kurtd@waikato.ac.nz) b Departm...
Kurt Driessens, Saso Dzeroski
EMSOFT
2005
Springer
15 years 5 months ago
Distributing synchronous programs using bounded queues
This paper is about the modular compilation and distribution of a sub-class of Simulink programs [9] across networks using bounded FIFO queues. The problem is first addressed mat...
Marco Zennaro, Raja Sengupta
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
15 years 5 months ago
Meta-grammar constant creation with grammatical evolution by grammatical evolution
This study examines the utility of meta-grammar constant generation on a series of benchmark problems. The performance of the meta-grammar approach is compared to a grammar which ...
Ian Dempsey, Michael O'Neill, Anthony Brabazon