5580 search results - page 818 / 1116 » Randomized priority algorithms |
130
click to vote
COLT
1992
Springer
15 years 7 months ago
1992
Springer
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
146
Voted
DAC
1989
ACM
15 years 7 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
124
click to vote
AUSAI
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
118
click to vote
EUROPAR
2009
Springer
15 years 7 months ago
2009
Springer
We consider a multi-processor system-on-chip destined for streaming applications. An application is composed of one input and one output queue and in-between, several levels of ide...
139
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...