5153 search results - page 734 / 1031 » Introduction to Randomized Algorithms |
151
click to vote
DAC
1989
ACM
15 years 8 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 ...
131
click to vote
AUSAI
2007
Springer
15 years 8 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...
131
Voted
EUROPAR
2009
Springer
15 years 8 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...
148
click to vote
GECCO
2009
Springer
15 years 8 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...
134
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...