Sciweavers

196 search results - page 11 / 40
» A generalized Weiszfeld method for the multi-facility locati...
Sort
View
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
14 years 2 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
MOBISYS
2006
ACM
14 years 8 months ago
ARIADNE: a dynamic indoor signal map construction and localization system
Location determination of mobile users within a building has attracted much attention lately due to its many applications in mobile networking including network intrusion detectio...
Yiming Ji, Saad Biaz, Santosh Pandey, Prathima Agr...
IROS
2006
IEEE
97views Robotics» more  IROS 2006»
14 years 2 months ago
Probabilistic Search for a Moving Target in an Indoor Environment
– We consider a search for a target moving within a known indoor environment partitioned into interconnected regions of varying sizes. The knowledge of target location is describ...
Haye Lau, Shoudong Huang, Gamini Dissanayake
BMCBI
2007
109views more  BMCBI 2007»
13 years 8 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 8 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup