8025 search results - page 319 / 1605 » Combinators Introduction: An Algorithm |
170
click to vote
AAAI
2006
15 years 8 months ago
2006
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...
195
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
200
click to vote
IPL
2000
15 years 6 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
168
click to vote
PRL
1998
15 years 6 months ago
1998
Surprisingly simple local learning algorithms are known to outperform many other global non-linear machines. Unfortunately, these algorithms are computationally costly. A means of...
174
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
A regular circuit structure called a Whirlpool PLA (WPLA) is proposed. It is suitable for the implementation of finite state machines as well as combinational logic. A WPLA is ...