Sciweavers

2412 search results - page 279 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
170
Voted
ICRA
2006
IEEE
110views Robotics» more  ICRA 2006»
15 years 9 months ago
Speeding-up Rao-blackwellized SLAM
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
152
Voted
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 7 months ago
An empirical investigation of how and why neutrality affects evolutionary search
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...
Edgar Galván López, Riccardo Poli
125
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz
130
Voted
CIMCA
2005
IEEE
15 years 9 months ago
Cognitive Perception in RAFALE-SP Methodology
Several methodologies based on Multi-agent Systems (MAS) already exist. They help designers to describe software or to create MAS which aim at solving complex problems by simulati...
Nicolas Marilleau, Christophe Lang, Pascal Chatonn...
COMPGEOM
2004
ACM
15 years 9 months ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...