Sciweavers

2337 search results - page 186 / 468
» Is the Open Way a Better Way
Sort
View
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
14 years 2 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
ICML
1999
IEEE
14 years 2 months ago
Feature Engineering for Text Classification
Most research in text classification to date has used a “bag of words” representation in which each feature corresponds to a single word. This paper examines some alternative ...
Sam Scott, Stan Matwin
DAC
1996
ACM
14 years 2 months ago
A Probability-Based Approach to VLSI Circuit Partitioning
Iterative-improvement 2-way min-cut partitioning is an important phase in most circuit partitioning tools. Most iterative improvement techniques for circuit netlists like the Fidd...
Shantanu Dutt, Wenyong Deng
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 2 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
CIKM
2006
Springer
14 years 2 months ago
Text classification improved through multigram models
Classification algorithms and document representation approaches are two key elements for a successful document classification system. In the past, much work has been conducted to...
Dou Shen, Jian-Tao Sun, Qiang Yang, Zheng Chen