4377 search results - page 347 / 876 » Mass problems and randomness |
160
click to vote
ICRA
2007
IEEE
16 years 1 months ago
2007
IEEE
— Designing algorithms for multi-robot systems can be a complex and difficult process: the cost of such systems can be very high, collecting experimental data can be timeconsumi...
203
click to vote
SAT
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
169
click to vote
ESCIENCE
2006
IEEE
16 years 26 days ago
2006
IEEE
: A relatively new meta-heuristic, known as extremal optimisation (EO), is based on the evolutionary science notion that poorly performing genes of an individual are replaced by ra...
134
click to vote
ICIP
2006
IEEE
16 years 25 days ago
2006
IEEE
Compressive sampling (CS), or “Compressed Sensing,” has recently generated a tremendous amount of excitement in the image processing community. CS involves taking a relatively...
177
click to vote
AICCSA
2005
IEEE
16 years 13 days ago
2005
IEEE
In this paper we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the gra...