5090 search results - page 392 / 1018 » Constructing Strategies for Programming |
158
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
162
click to vote
IPPS
1995
IEEE
15 years 10 months ago
1995
IEEE
The RACE R
parallel computer system provides a highperformance parallel interconnection network at low cost. This paper describes the architecture and implementation of the RACE ...
159
click to vote
ACL
2007
15 years 8 months ago
2007
Previous studies in data-driven dependency parsing have shown that tree transformations can improve parsing accuracy for specific parsers and data sets. We investigate to what ex...
139
Voted
ESANN
2007
15 years 8 months ago
2007
Abstract. Our work is concerned with finding optimum connection strategies in highperformance associative memory models. Taking inspiration from axonal branching in biological neur...
195
click to vote
AUTOMATICA
2007
15 years 7 months ago
2007
An image-based strategy for visual servo control of a class of dynamic systems is proposed. The class of systems considered includes dynamic models of unmanned aerial vehicles cap...