Sciweavers

2526 search results - page 217 / 506
» A Comparative Evaluation of Name-Matching Algorithms
Sort
View
132
Voted
HEURISTICS
2007
139views more  HEURISTICS 2007»
15 years 3 months ago
A composite-neighborhood tabu search approach to the traveling tournament problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
Luca Di Gaspero, Andrea Schaerf
ICML
2003
IEEE
16 years 4 months ago
Boosting Lazy Decision Trees
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
Xiaoli Zhang Fern, Carla E. Brodley
ICCD
2004
IEEE
112views Hardware» more  ICCD 2004»
16 years 14 days ago
Combined Channel Segmentation and Buffer Insertion for Routability and Performance Improvement of Field
In this paper, we propose a combined channel segmentation and buffer insertion approach, which minimizes the number of buffers inserted while satisfying the delay constraints for ...
Hu Huang, Joseph B. Bernstein, Martin Peckerar, Ji...
SAC
2010
ACM
15 years 10 months ago
Infrastructureless storage in dynamic environments
This paper studies the use of highly dynamic networks as infrastructures for persistent storage of data that offer services at specific geographical zones in a decentralized and...
Jose Luis Fernandez-Marquez, Josep Lluís Ar...
ICML
2009
IEEE
15 years 10 months ago
Online learning by ellipsoid method
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
Liu Yang, Rong Jin, Jieping Ye