16430 search results - page 157 / 3286 » On Computable Tree Functions |
147
Voted
ITSSA
2006
15 years 3 months ago
2006
: This article proposes a new method for creating test software for object-oriented systems using a genetic programming approach. It is believed that this approach is advantageous ...
120
Voted
FOCS
2009
IEEE
15 years 1 months ago
2009
IEEE
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
114
Voted
ICCAD
2007
IEEE
16 years 17 days ago
2007
IEEE
— In this paper, we present the first work on the Steiner routing for 3D stacked ICs. In the 3D Steiner routing problem, the pins are located in multiple device layers, which ma...
129
Voted
NAACL
2010
15 years 1 months ago
2010
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...
112
Voted
IANDC
2007
15 years 3 months ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...