Sciweavers

3894 search results - page 490 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ICRA
2009
IEEE
134views Robotics» more  ICRA 2009»
15 years 11 months ago
Combining search and action for mobile robots
— We explore the interconnection between search and action in the context of mobile robotics. The task of searching for an object and then performing some action with that object...
Geoffrey Hollinger, Dave Ferguson, Siddhartha Srin...
GD
2004
Springer
15 years 9 months ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu
JAIR
2006
143views more  JAIR 2006»
15 years 4 months ago
Convexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
Tom Heskes
JSAC
2006
128views more  JSAC 2006»
15 years 4 months ago
A framework for misuse detection in ad hoc networks- part II
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
D. Subhadrabandhu, S. Sarkar, F. Anjum
GECCO
2008
Springer
147views Optimization» more  GECCO 2008»
15 years 5 months ago
On selecting the best individual in noisy environments
In evolutionary algorithms, the typical post-processing phase involves selection of the best-of-run individual, which becomes the final outcome of the evolutionary run. Trivial f...
Wojciech Jaskowski, Wojciech Kotlowski