2403 search results - page 391 / 481 » Optimal Randomized RANSAC |
140
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
ICDCIT
2005
Springer
15 years 8 months ago
2005
Springer
An algorithm for time division multiple access (TDMA) is desirable in sensor networks for energy management, as it allows a sensor to reduce the amount of idle listening. Also, TD...
116
click to vote
IWQOS
2005
Springer
15 years 8 months ago
2005
Springer
Network coding has been recently proposed in information theory as a new dimension of the information multicast problem that helps achieve optimal transmission rate or cost. End ho...
137
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
131
click to vote
VLDB
2005
ACM
15 years 8 months ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...