7930 search results - page 269 / 1586 » Greedy in Approximation Algorithms |
150
click to vote
GECCO
2005
Springer
16 years 3 days ago
2005
Springer
The tagging problem in natural language processing is to find a way to label every word in a text as a particular part of speech, e.g., proper noun. An effective way of solving th...
180
click to vote
HIPC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
125
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
As the process technology enters the nanometer era, reliability has become a major concern in the design and manufacturing of VLSI circuits. In this paper we focus on one reliabil...
177
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
171
click to vote
IPL
2000
15 years 6 months ago
2000
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...