411 search results - page 40 / 83 » A New Approach to the Rectilinear Steiner Tree Problem |
ICML
2009
IEEE
15 years 4 months ago
2009
IEEE
The label ranking problem consists of learning a model that maps instances to total orders over a finite set of predefined labels. This paper introduces new methods for label ra...
ICGI
1998
Springer
15 years 1 months ago
1998
Springer
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has b...
102
click to vote
ICCAD
2007
IEEE
15 years 6 months ago
2007
IEEE
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
139
click to vote
ICTAI
2003
IEEE
15 years 3 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
NIPS
2003
14 years 11 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...